Sciweavers

2899 search results - page 201 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
APVIS
2004
15 years 8 months ago
Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation
Two and a half dimensional graph visualisation is the stacking of a set of related graphs into the third dimension to support visual comparison. A new aesthetic criterion is intro...
Tim Dwyer, Falk Schreiber
JMLR
2012
13 years 9 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 6 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
16 years 1 months ago
On Making Directed Graphs Transitive
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
INFOCOM
2008
IEEE
16 years 1 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...