Sciweavers

7006 search results - page 419 / 1402
» Approximation Algorithms
Sort
View
AINA
2007
IEEE
15 years 11 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
NIPS
2004
15 years 6 months ago
Incremental Algorithms for Hierarchical Classification
We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchi...
Nicolò Cesa-Bianchi, Claudio Gentile, Andre...
SIAMMA
2011
97views more  SIAMMA 2011»
14 years 7 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
SSS
2009
Springer
15 years 11 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
STACS
2009
Springer
15 years 11 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall