1673 search results - page 227 / 335 » Taming the Dynamics of Distributed Data |
220
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
189
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
158
click to vote
IMC
2009
ACM
16 years 19 days ago
2009
ACM
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
203
click to vote
ML
2010
ACM
15 years 4 months ago
2010
ACM
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
149
click to vote
SENSYS
2006
ACM
16 years 2 days ago
2006
ACM
Small-form-factor, low-power wireless sensors—motes—are convenient to deploy, but lack the bandwidth to capture and transmit raw high-frequency data, such as human voices or n...