Sciweavers

1399 search results - page 214 / 280
» New Algorithms for k-Center and Extensions
Sort
View
SECON
2007
IEEE
14 years 3 months ago
A Framework for Resilient Online Coverage in Sensor Networks
—We consider surveillance applications in which sensors are deployed in large numbers to improve coverage fidelity. Previous research has studied how to select active sensor cov...
Ossama Younis, Marwan Krunz, Srinivasan Ramasubram...
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
14 years 2 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
14 years 2 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
ICB
2007
Springer
148views Biometrics» more  ICB 2007»
14 years 2 months ago
Walker Recognition Without Gait Cycle Estimation
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
Daoliang Tan, Shiqi Yu, Kaiqi Huang, Tieniu Tan
SSD
2007
Springer
124views Database» more  SSD 2007»
14 years 2 months ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...