1547 search results - page 250 / 310 » Solving Knapsack Problems in a Sticker Based Model |
127
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
103
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
137
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We address the problem of object detection and segmentation using holistic properties of object shape. Global shape representations are highly susceptible to clutter inevitably pr...
128
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
127
click to vote
SMA
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we propose a novel shape interpolation approach based on Poisson equation. We formulate the trajectory problem of shape interpolation as solving Poisson equations d...