Sciweavers

817 search results - page 47 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
TCBB
2011
13 years 3 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
ROBOTICA
2002
72views more  ROBOTICA 2002»
13 years 8 months ago
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
Shigang Yue, Dominik Henrich, W. L. Xu, S. K. Tso
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
14 years 1 months ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 1 months ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
CVIU
2011
13 years 6 days ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...