1142 search results - page 104 / 229 » Set Variables and Local Search |
128
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
166
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Markerless tracking of human pose is a hard yet relevant problem. In this paper, we derive an efficient filtering algorithm for tracking human pose at 4-10 frames per second using...
152
click to vote
TKDE
2008
15 years 3 months ago
2008
In this paper, a new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set. ...
141
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
143
click to vote
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...