942 search results - page 127 / 189 » Distance Constraint Satisfaction Problems |
109
click to vote
DATAMINE
2007
15 years 3 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
132
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
130
Voted
AI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
134
click to vote
CP
1998
Springer
15 years 7 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...
127
Voted
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...