Sciweavers

5592 search results - page 264 / 1119
» On Random Betweenness Constraints
Sort
View
AAAI
2004
15 years 8 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
15 years 8 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney
CP
2010
Springer
15 years 5 months ago
A Generic Visualization Platform for CP
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, ...
Helmut Simonis, Paul Davern, Jacob Feldman, Deepak...
TIT
2011
97views more  TIT 2011»
15 years 1 months ago
Error Exponents for the Gaussian Channel With Active Noisy Feedback
We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an activ...
Young-Han Kim, Amos Lapidoth, Tsachy Weissman
JMLR
2012
13 years 9 months ago
Deterministic Annealing for Semi-Supervised Structured Output Learning
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
Paramveer S. Dhillon, S. Sathiya Keerthi, Kedar Be...