Sciweavers

483 search results - page 84 / 97
» On perfectness of sums of graphs
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 9 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 8 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
SOSP
2009
ACM
14 years 5 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
ROBOCOMM
2007
IEEE
14 years 2 months ago
Decentralized swarm aggregation with static communication links
— The objective of this paper is decentralized swarm aggregation with collision avoidance. Specifically, each agent is assigned with a control law which is the sum of two elemen...
Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
FOCS
2006
IEEE
14 years 2 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner