Sciweavers

172 search results - page 27 / 35
» On the cost of searching signature trees
Sort
View
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 2 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
NLP
2000
13 years 11 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
INFOCOM
2010
IEEE
13 years 6 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...
ICRA
2002
IEEE
111views Robotics» more  ICRA 2002»
14 years 16 days ago
Feature-Based Multi-Hypothesis Localization and Tracking for Mobile Robots using Geometric Constraints
In this paper we present a new probabilistic feature-based approach to multi-hypothesis global localization and pose tracking. Hypotheses are generated using a constraintbased sea...
Kai Oliver Arras, José A. Castellanos, Rola...