Sciweavers

8647 search results - page 711 / 1730
» The Container Selection Problem
Sort
View
PAMI
2011
15 years 2 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
TCBB
2011
15 years 2 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
170
Voted
TR
2010
131views Hardware» more  TR 2010»
15 years 2 months ago
A Memetic Algorithm for Multi-Level Redundancy Allocation
Redundancy allocation problems (RAPs) have attracted much attention for the past thirty years due to its wide applications in improving the reliability of various engineering syste...
Zai Wang, Ke Tang, Xin Yao
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
189
Voted
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
15 years 7 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...