Sciweavers

1632 search results - page 91 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
139
Voted
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 7 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
141
Voted
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
15 years 9 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
132
Voted
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 3 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
133
Voted
WCNC
2008
IEEE
15 years 10 months ago
Estimation of Link Quality and Residual Time in Vehicular Ad Hoc Networks
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Nikoletta Sofra, Kin K. Leung
144
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran