373 search results - page 63 / 75 » Querying Priced Information in Databases: The Conjunctive Ca... |
SSD
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
105
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
ECIR
2008
Springer
14 years 11 months ago
2008
Springer
We propose a new approach to a music search engine that can be accessed via natural language queries. As with existing approaches, we try to gather as much contextual information a...
111
click to vote
DAWAK
2007
Springer
15 years 3 months ago
2007
Springer
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
107
click to vote
BMCBI
2002
14 years 9 months ago
2002
Background: Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do no...