Sciweavers

1588 search results - page 260 / 318
» Consistent query answering in databases
Sort
View
ICALP
2004
Springer
15 years 5 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
SPAA
2009
ACM
16 years 11 days ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
CLEF
2005
Springer
15 years 5 months ago
Dictionary-Based Amharic-French Information Retrieval
We present four approaches to the Amharic - French bilingual track at CLEF 2005. All experiments use a dictionary based approach to translate the Amharic queries into French Bags-...
Atelach Alemu Argaw, Lars Asker, Rickard Cöst...
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
14 years 9 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
SIGMOD
2006
ACM
126views Database» more  SIGMOD 2006»
15 years 12 months ago
Declarative networking: language, execution and optimization
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for...
Boon Thau Loo, Tyson Condie, Minos N. Garofalakis,...