Sciweavers

520 search results - page 12 / 104
» Subset Counting in Trees
Sort
View
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 19 days ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
CIKM
2006
Springer
13 years 11 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
SIAMCOMP
2000
69views more  SIAMCOMP 2000»
13 years 7 months ago
A Finite State Version of the Kraft--McMillan Theorem
The main result is a finite-state version of the Kraft
Frédérique Bassino, Marie-Pierre B&e...
IPPS
2007
IEEE
14 years 2 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...