Sciweavers

1985 search results - page 350 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
14 years 3 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
101
Voted
ICCV
2007
IEEE
16 years 2 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 20 days ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
100
Voted
MOBIHOC
2003
ACM
16 years 3 days ago
Lightweight sensing and communication protocols for target enumeration and aggregation
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
Qing Fang, Feng Zhao, Leonidas J. Guibas
PLDI
2006
ACM
15 years 6 months ago
Optimizing data permutations for SIMD devices
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...
Gang Ren, Peng Wu, David A. Padua