970 search results - page 178 / 194 » On encodings of spanning trees |
ICDE
2003
IEEE
14 years 11 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
MOBIHOC
2007
ACM
14 years 9 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...