Author
Evangelos Kranakis
Other affiliations: Purdue University, Carleton College, Centrum Wiskunde & Informatica ...read more
Bio: Evangelos Kranakis is an academic researcher from Carleton University. The author has contributed to research in topics: Mobile robot & Robot. The author has an hindex of 46, co-authored 502 publications receiving 10330 citations. Previous affiliations of Evangelos Kranakis include Purdue University & Carleton College.
Topics: Mobile robot, Robot, Node (networking), Rendezvous, Unit disk graph
Papers published on a yearly basis
Papers
More filters
•
01 Jan 1999
TL;DR: A close look at maps of numerous cities around the world, show that the previous way to explore a new, and unknown city will in general yield walks that will be close to the optimal ones to travel from one location to another.
Abstract: Suppose that a traveler arrives to the City of Toronto, and wants to walk to the famous CN-Tower, one of the tallest free-standing structures in the world. Assume now that our visitor, lacking a map of Toronto, is standing at a crossing from which he can see the CN-tower, and several streets S1, . . . , Sm that he can choose to start his walk. A natural (and most likely safe assumption), is that our visitor must choose to walk first along the road that points closest in the direction of the CN-tower, see Figure 1. A close look at maps of numerous cities around the world, show us that the previous way to explore a new, and unknown city will in general yield walks that will be close enough to the optimal ones to travel from one location to another. In mathematical terms, we can model the map of many cities by geometric graphs in which street intersections are represented by the vertices of our graphs, and streets by straight line segments. Compass routing on geometric networks, in its most elemental form yields the following algorithm:
964 citations
••
TL;DR: For points in three dimensions it is shown that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard and an O(n 2 ) time approximation algorithm is given which provides a completerange assignment with cost within a factor of two of the minimum.
468 citations
••
TL;DR: A new concept of the asymptotic Z-score is introduced and a fast, whole-genome scanning algorithm is described to compute asymPTotic minimum free energy Z-scores of moving-window contents of ESTs and genomes.
Abstract: We present results of computer experiments that indicate that several RNAs for which the native state (minimum free energy secondary structure) is functionally important (type III hammerhead ribozymes, signal recognition particle RNAs, U2 small nucleolar spliceosomal RNAs, certain riboswitches, etc.) all have lower folding energy than random RNAs of the same length and dinucleotide frequency. Additionally, we find that whole mRNA as well as 5′-UTR, 3′-UTR, and cds regions of mRNA have folding energies comparable to that of random RNA, although there may be a statistically insignificant trace signal in 3′-UTR and cds regions. Various authors have used nucleotide (approximate) pattern matching and the computation of minimum free energy as filters to detect potential RNAs in ESTs and genomes. We introduce a new concept of the asymptotic Z-score and describe a fast, whole-genome scanning algorithm to compute asymptotic minimum free energy Z-scores of moving-window contents. Asymptotic Z-score computations offer another filter, to be used along with nucleotide pattern matching and minimum free energy computations, to detect potential functional RNAs in ESTs and genomic regions.
225 citations
01 Jan 2003
TL;DR: This paper presents a new algorithm that exploits the phase characteristics for detection purposes and expects that the higher detection rate will result in a higher classification rate and thus support various device authetication schemes in the wireless domain.
Abstract: Radio Frequency Fingerprinting (RFF) is a technique, which has been used to identify wireless devices It essentially involves the detection of the transient signal and the extraction of the fingerprint The detection phase, in our opinion, is the most challenging yet crucial part of the RFF process Current approaches, namely Threshold and Bayesian Step Change Detector, which use amplitude characteristics of signals for transient detection, perform poorly with certain types of signals This paper presents a new algorithm that exploits the phase characteristics for detection purposes Validation using Bluetooth signals has resulted in a success rate of approximately 85-90 percent We anticipate that the higher detection rate will result in a higher classification rate and thus support various device authetication schemes in the wireless domain
211 citations
••
TL;DR: It is shown that Bloom's analysis is incorrect and give a correct analysis of randomized data structure for membership queries dating back to 1970.
184 citations
Cited by
More filters
•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597 citations
••
[...]
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.
7,116 citations
01 Aug 2000
TL;DR: Assessment of medical technology in the context of commercialization with Bioentrepreneur course, which addresses many issues unique to biomedical products.
Abstract: BIOE 402. Medical Technology Assessment. 2 or 3 hours. Bioentrepreneur course. Assessment of medical technology in the context of commercialization. Objectives, competition, market share, funding, pricing, manufacturing, growth, and intellectual property; many issues unique to biomedical products. Course Information: 2 undergraduate hours. 3 graduate hours. Prerequisite(s): Junior standing or above and consent of the instructor.
4,833 citations
01 Jan 2016
TL;DR: This paper critically analyzes the deployment issues of best three proposals considering trade-off between security functions and performance overhead and concludes that none of them is deployable in practical scenario.
Abstract: Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or 'prefixes' which designate network reachability among autonomous systems (AS). Point of concern in BGP is its lack of effective security measures which makes Internet vulnerable to different forms of attacks. Many solutions have been proposed till date to combat BGP security issues but not a single one is deployable in practical scenario. Any security proposal with optimal solution should offer adequate security functions, performance overhead and deployment cost. This paper critically analyzes the deployment issues of best three proposals considering trade-off between security functions and performance overhead.
2,691 citations