Sciweavers

84 search results - page 10 / 17
» Combinatorial Optimization Solutions for the Maximum Quartet...
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
MVA
2007
173views Computer Vision» more  MVA 2007»
13 years 9 months ago
Microscopic Image Segmentation with Two-dimensional Exponential Entropy Based on Hybrid Microcanonical Annealing
Counting cells and following the evolution of the biological layers are important applications in microscopic imagery. In this paper, a microscopic image segmentation method with ...
Amir Nakib, Hamouche Oulhadj, Patrick Siarry
CORR
2010
Springer
338views Education» more  CORR 2010»
13 years 7 months ago
Optimal Distributed P2P Streaming under Node Degree Bounds
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
Shaoquan Zhang, Ziyu Shao, Minghua Chen
ICCV
2009
IEEE
15 years 14 days ago
Optimal Correspondences from Pairwise Constraints
Correspondence problems are of great importance in computer vision. They appear as subtasks in many applications such as object recognition, merging partial 3D reconstructions a...
Olof Enqvist, Klas Josephson, Fredrik Kahl
AAAI
2000
13 years 8 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith