Sciweavers

648 search results - page 82 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
14 years 17 days ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
ICCV
2007
IEEE
14 years 11 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 3 months ago
Joint Design of Tx-Rx Beamformers in MIMO Downlink Channel
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
Marian Codreanu, Antti Tölli, Markku J. Juntt...
PPSN
1998
Springer
14 years 1 months ago
Niching and Elitist Models for MOGAs
This paper examines several niching and elitist models applied to Multiple-Objective Genetic Algorithms (MOGAs). Test cases consider a simple problem as well as multidisciplinary d...
Shigeru Obayashi, Shinichi Takahashi, Yukihiro Tak...
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
14 years 3 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan