Sciweavers

6199 search results - page 1237 / 1240
» But who will monitor the monitor
Sort
View
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 10 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
CVPR
2012
IEEE
11 years 10 months ago
Laser speckle photography for surface tampering detection
It is often desirable to detect whether a surface has been touched, even when the changes made to that surface are too subtle to see in a pair of before and after images. To addre...
Yi-Chang Shih, Abe Davis, Samuel W. Hasinoff, Fr&e...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 10 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
TKDE
2012
487views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
« Prev « First page 1237 / 1240 Last » Next »