958 search results - page 51 / 192 » Efficient data structures for range-aggregate queries on tre... |
110
Voted
NIPS
2004
15 years 1 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
177
click to vote
VLDB
2007
ACM
16 years 22 days ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
102
click to vote
PKDD
2009
Springer
15 years 7 months ago
2009
Springer
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...