Sciweavers

109 search results - page 4 / 22
» Fast Prefix Search in Little Space, with Applications
Sort
View
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 2 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
IROS
2007
IEEE
159views Robotics» more  IROS 2007»
14 years 2 months ago
Transfer of policies based on trajectory libraries
— Libraries of trajectories are a promising way of creating policies for difficult problems. However, often it is not desirable or even possible to create a new library for ever...
Martin Stolle, Hanns Tappeiner, Joel E. Chestnutt,...
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 3 months ago
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
Holger Bast, Fabian M. Suchanek, Ingmar Weber
ICDCS
1999
IEEE
14 years 25 days ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
ECCV
2010
Springer
14 years 1 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov