Sciweavers

5316 search results - page 312 / 1064
» Which Search Problems Are Random
Sort
View
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
15 years 7 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
JAIR
2006
102views more  JAIR 2006»
15 years 6 months ago
Multiple-Goal Heuristic Search
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
Dmitry Davidov, Shaul Markovitch
ICDCS
2005
IEEE
15 years 12 months ago
Similarity Searching in Peer-to-Peer Databases
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
IIS
2004
15 years 7 months ago
Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
Stanislaw Osinski, Jerzy Stefanowski, Dawid Weiss
ICPR
2006
IEEE
16 years 7 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara