Sciweavers

762 search results - page 24 / 153
» Finding Facilities Fast
Sort
View
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
14 years 11 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
ADHOCNOW
2010
Springer
14 years 11 months ago
Coverage-Adaptive Random Walks for Fast Sensory Data Collection
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...
106
Voted
TON
2008
125views more  TON 2008»
14 years 9 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
68
Voted
ICPR
2008
IEEE
15 years 11 months ago
Fast and regularized local metric for query-based operations
To learn a metric for query?based operations, we combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric in a unified algorithm to find...
Frank P. Ferrie, Karim T. Abou-Moustafa
67
Voted
ICPR
2002
IEEE
15 years 10 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha