Sciweavers

2354 search results - page 375 / 471
» A Common-Sense Theory of Time
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 10 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
ICFP
2007
ACM
14 years 10 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
MOBIHOC
2004
ACM
14 years 10 months ago
Internal synchronization of drift-constraint clocks in ad-hoc sensor networks
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
Lennart Meier, Philipp Blum, Lothar Thiele
SPAA
2009
ACM
14 years 5 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn