6615 search results - page 400 / 1323 » Indexing Multiple Sets |
218
click to vote
SSD
2005
Springer
16 years 1 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 ...
229
click to vote
DSMML
2004
Springer
16 years 1 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
207
click to vote
SIGMOD
2010
ACM
16 years 15 days ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
197
click to vote
CIKM
2009
Springer
16 years 10 days ago
2009
Springer
With the development of positioning technologies and the boosting deployment of inexpensive location-aware sensors, large volumes of trajectory data have emerged. However, efficie...
199
click to vote
GECCO
2009
Springer
16 years 9 days ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...