5316 search results - page 138 / 1064 » Which Search Problems Are Random |
138
Voted
BIOCOMP
2007
15 years 5 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
123
Voted
EMNLP
2007
15 years 5 months ago
2007
Traditional research on spelling correction in natural language processing and information retrieval literature mostly relies on pre-defined lexicons to detect spelling errors. Bu...
146
click to vote
JSAT
2008
15 years 3 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
117
Voted
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we discuss the potential for semantic search and focus on the most immediate problem toward its realization: the problem of the sparsity and relatively low quality of...
110
Voted
ICCCN
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—CAN is a well-known DHT technique for contentbased P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed i...