Sciweavers

3514 search results - page 78 / 703
» A search space
Sort
View
FOCS
1992
IEEE
14 years 2 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
ECIR
2011
Springer
13 years 1 months ago
SkipBlock: Self-indexing for Block-Based Inverted List
In large web search engines the performance of Information Retrieval systems is a key issue. Block-based compression methods are often used to improve the search performance, but c...
Stéphane Campinas, Renaud Delbru, Giovanni ...
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 10 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
DSS
2000
95views more  DSS 2000»
13 years 10 months ago
Exploring the use of concept spaces to improve medical information retrieval
This research investigated the application of techniques successfully used in previous information retrieval research, to the more challenging area of medical informatics. It was ...
Andrea L. Houston, Hsinchun Chen, Bruce R. Schatz,...
ICPR
2004
IEEE
14 years 11 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach