Sciweavers

182 search results - page 23 / 37
» Simple Generalized Maximum Flow Algorithms
Sort
View
FOCS
2008
IEEE
15 years 21 days ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
108
Voted
ICCV
2009
IEEE
16 years 4 months ago
A Global Perspective on MAP Inference for Low-Level Vision
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for low-level vision applications. However, in a maximum a posteriori (MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...
WABI
2001
Springer
110views Bioinformatics» more  WABI 2001»
15 years 4 months ago
Boosting EM for Radiation Hybrid and Genetic Mapping
Radiation hybrid (RH) mapping is a somatic cell technique that is used for ordering markers along a chromosome and estimating physical distances between them. It nicely complements...
Thomas Schiex, Patrick Chabrier, Martin Bouchez, D...
FOCS
2008
IEEE
15 years 6 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
SIGIR
2002
ACM
14 years 11 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby