291 search results - page 3 / 59 » Efficiently Processing Continuous k-NN Queries on Data Strea... |
CVDB
2004
ACM
13 years 10 months ago
2004
ACM
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
RTCSA
2007
IEEE
13 years 11 months ago
2007
IEEE
RFID middleware systems collect and filter RFID streaming data gathered continuously by numerous readers to process requests from applications. These requests are called continuou...
ICSNC
2007
IEEE
13 years 11 months ago
2007
IEEE
RFID data are usually regarded as streaming data that are huge and change frequently because they are gathered continuously by numerous readers. RFID middleware filters the data a...
ICDCS
2007
IEEE
13 years 8 months ago
2007
IEEE
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...