2121 search results - page 136 / 425 » Indexing Incomplete Databases |
165
click to vote
SSD
2005
Springer
15 years 10 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
141
Voted
SSDBM
2003
IEEE
15 years 10 months ago
2003
IEEE
Many emerging applications benefit from the extraction of geospatial data specified at different resolutions for viewing purposes. Data must also be topologically accurate and up-...
148
click to vote
SIGMOD
2011
ACM
14 years 8 months ago
2011
ACM
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
154
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
157
click to vote
BIOCOMP
2007
15 years 6 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...