2593 search results - page 118 / 519 » constraints 2007 |
157
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
136
click to vote
ICRA
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract— This paper addresses the optimal control of nonholonomic systems through provably correct discretization of the system dynamics. The essence of the approach lies in the...
213
click to vote
IJCAI
2003
15 years 7 months ago
2003
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
182
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
162
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...