Sciweavers

6976 search results - page 320 / 1396
» The Oil Searching Problem
Sort
View
ACMSE
2006
ACM
16 years 21 days ago
Inductive bases and their application to searches for minimal unary NFAs
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
Geoffrey Smith
ICDCS
2005
IEEE
16 years 10 days 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...
HM
2005
Springer
87views Optimization» more  HM 2005»
16 years 7 days ago
A Taxonomy of Cooperative Search Algorithms
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
Mohammed El-Abd, Mohamed Kamel
IJCAI
2007
15 years 8 months ago
Learning User Clicks in Web Search
Machine learning for predicting user clicks in Webbased search offers automated explanation of user activity. We address click prediction in the Web search scenario by introducing...
Ding Zhou, Levent Bolelli, Jia Li, C. Lee Giles, H...
IIS
2004
15 years 8 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