958 search results - page 70 / 192 » Efficient data structures for range-aggregate queries on tre... |
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
152
Voted
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
153
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Increasing monitoring of transactions, environmental parameters, homeland security, RFID chips and interactions of online users rapidly establishes new data sources and applicatio...
182
click to vote
STOC
2003
ACM
15 years 10 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...