5592 search results - page 255 / 1119 » On Random Betweenness Constraints |
455
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
320
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
160
click to vote
SARA
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
190
click to vote
CPAIOR
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
185
click to vote
DIS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examini...