23 search results - page 4 / 5 » Near-Optimal Sublinear Time Algorithms for Ulam Distance |
JSAC
2008
13 years 5 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
IPSN
2007
Springer
13 years 12 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
SECON
2007
IEEE
14 years 1 days ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...