Sciweavers

1736 search results - page 274 / 348
» The rank-width of Directed Graphs
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 4 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
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 4 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
16 years 4 months ago
Large human communication networks: patterns and a utility-driven generator
Given a real, and weighted person-to-person network which changes over time, what can we say about the cliques that it contains? Do the incidents of communication, or weights on t...
Nan Du, Christos Faloutsos, Bai Wang, Leman Akoglu
VLSID
2005
IEEE
255views VLSI» more  VLSID 2005»
16 years 4 months ago
Estimation of Switching Activity in Sequential Circuits Using Dynamic Bayesian Networks
We propose a novel, non-simulative, probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher ord...
Sanjukta Bhanja, Karthikeyan Lingasubramanian, N. ...
VLDB
2007
ACM
225views Database» more  VLDB 2007»
16 years 4 months ago
An Approach to Optimize Data Processing in Business Processes
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
Marko Vrhovnik, Holger Schwarz, Oliver Suhre, Bern...