176 search results - page 31 / 36 » A fractal representation for real optimization |
97
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an appr...
110
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
102
Voted
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a novel method for recovering the 3D structure and scene flow from calibrated multi-view sequences. We propose a 3D point cloud parametrization of the 3D structure and ...
109
click to vote
PRL
2006
15 years 8 days ago
2006
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
101
click to vote
TKDE
2008
15 years 7 days ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...