Sciweavers

448 search results - page 20 / 90
» Fast Approximation Algorithms for Multicommodity Flow Proble...
Sort
View
NETWORKS
2011
13 years 3 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
EC
2011
240views ECommerce» more  EC 2011»
13 years 3 months ago
HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
Abstract—In the field of evolutionary multi-criterion optimization, the hypervolume indicator is the only single set quality measure that is known to be strictly monotonic with ...
Johannes Bader, Eckart Zitzler
INFOCOM
2010
IEEE
13 years 7 months ago
MIMO-Aware Routing in Wireless Mesh Networks
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
Shan Chu, Xin Wang
ICRA
2009
IEEE
150views Robotics» more  ICRA 2009»
14 years 3 months ago
Flow separation for fast and robust stereo odometry
— Separating sparse flow provides fast and robust stereo visual odometry that deals with nearly degenerate situations that often arise in practical applications. We make use of ...
Michael Kaess, Kai Ni, Frank Dellaert
ICASSP
2011
IEEE
13 years 11 days ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...