Sciweavers

4198 search results - page 81 / 840
» In search of lost time
Sort
View
SIGIR
1998
ACM
15 years 10 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
16 years 20 days ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
TREC
1994
15 years 7 months ago
Searching For Meaning With The Help Of A PADRE
Full-text scanning oers signi cant advantages over other methods of document retrieval but is normally too slow for use on large collections. The Fujitsu AP1000 parallel distribut...
David Hawking, Paul B. Thistlewaite
DAGM
2005
Springer
15 years 11 months ago
A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
Eric Wahl, Gerd Hirzinger
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 11 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener