13603 search results - page 2397 / 2721 » On the Complexity of Computing Treelength |
163
click to vote
SIGCOMM
2010
ACM
15 years 7 months ago
2010
ACM
The basic building block of ever larger data centers has shifted from a rack to a modular container with hundreds or even thousands of servers. Delivering scalable bandwidth among...
199
click to vote
SIGMETRICS
2010
ACM
15 years 7 months ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
182
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run...
184
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
197
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...