316 search results - page 21 / 64 » Bounded Depth Data Trees |
PERCOM
2008
ACM
14 years 8 months ago
2008
ACM
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
SECON
2008
IEEE
14 years 3 months ago
2008
IEEE
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
DCOSS
2006
Springer
14 years 23 days ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
PODS
2007
ACM
14 years 9 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...