Sciweavers

281 search results - page 44 / 57
» Balancing weight-balanced trees
Sort
View
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 12 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
FTDCS
2003
IEEE
14 years 21 days ago
Resource- and Quality-Aware Application-Level Service Multicast
—Current multimedia application deployment tends to rely on composable service systems, where a complex multimedia service can be composed dynamically from multiple simpler ones ...
Jingwen Jin, Klara Nahrstedt
BMCBI
2007
119views more  BMCBI 2007»
13 years 7 months ago
A dynamic programming approach for the alignment of signal peaks in multiple gas chromatography-mass spectrometry experiments
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...
Mark D. Robinson, David P. De Souza, Woon Wai Keen...
FSTTCS
2009
Springer
14 years 1 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
PPOPP
2010
ACM
14 years 4 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...