Sciweavers

3575 search results - page 165 / 715
» Structured motifs search
Sort
View
FUIN
2006
81views more  FUIN 2006»
15 years 6 months ago
Indexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
Vladimir Pestov, Aleksandar Stojmirovic
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 6 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
TOC
2010
155views Management» more  TOC 2010»
15 years 1 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
WWW
2006
ACM
16 years 7 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 10 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani