15 search results - page 1 / 3 » Is partial quantum search of a database any easier |
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
ICHIM
2001
13 years 6 months ago
2001
Many archives have introduced online archival databases in the past few years. However, apart from being independent of place and time, hardly any of these databases make finding ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
BMCBI
2006
13 years 5 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
GIS
2008
ACM
14 years 6 months ago
2008
ACM
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...