Sciweavers

1093 search results - page 51 / 219
» Clustering from Constraint Graphs
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 9 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
EUROSYS
2007
ACM
15 years 9 months ago
Dryad: distributed data-parallel programs from sequential building blocks
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrel...
EUROMICRO
1996
IEEE
15 years 4 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
CVPR
2010
IEEE
15 years 9 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain
DILS
2008
Springer
15 years 1 months ago
Semi Supervised Spectral Clustering for Regulatory Module Discovery
We propose a novel semi-supervised clustering method for the task of gene regulatory module discovery. The technique uses data on dna binding as prior knowledge to guide the proces...
Alok Mishra, Duncan Gillies