Sciweavers

1867 search results - page 303 / 374
» Model-Checking Based Data Retrieval
Sort
View
WWW
2007
ACM
16 years 3 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
131
Voted
WWW
2005
ACM
16 years 3 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 2 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
134
Voted
ESWS
2009
Springer
15 years 9 months ago
ONKI SKOS Server for Publishing and Utilizing SKOS Vocabularies and Ontologies as Services
Vocabularies are the building blocks of the Semantic Web providing shared terminological resources for content indexing, information retrieval, data exchange, and content integrati...
Jouni Tuominen, Matias Frosterus, Kim Viljanen, Ee...
SIGSOFT
2005
ACM
15 years 8 months ago
Detecting higher-level similarity patterns in programs
Cloning in software systems is known to create problems during software maintenance. Several techniques have been proposed to detect the same or similar code fragments in software...
Hamid Abdul Basit, Stan Jarzabek