Sciweavers

1285 search results - page 191 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ESTIMEDIA
2003
Springer
14 years 3 months ago
Perception Coprocessors for Embedded Systems
Recognizing speech, gestures, and visual features are important interface capabilities for embedded mobile systems. Perception algorithms have many traits in common with more conv...
Binu K. Mathew, Al Davis, Ali Ibrahim
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
PODC
2000
ACM
14 years 2 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
KDD
2010
ACM
253views Data Mining» more  KDD 2010»
14 years 1 months ago
Mining periodic behaviors for moving objects
Periodicity is a frequently happening phenomenon for moving objects. Finding periodic behaviors is essential to understanding object movements. However, periodic behaviors could b...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays, P...
DAGSTUHL
2010
13 years 11 months ago
Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
The display of surfaces and solids has usually been restricted to the domain of scientific visualization; however, little work has been done on the visualization of surfaces and s...
Matthew O. Ward, Zhenyu Guo