Sciweavers

729 search results - page 39 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
114
Voted
IJON
2008
92views more  IJON 2008»
15 years 3 months ago
Nonnegative matrix factorization with quadratic programming
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
Rafal Zdunek, Andrzej Cichocki
158
Voted
BMCBI
2004
138views more  BMCBI 2004»
15 years 3 months ago
Constraint Logic Programming approach to protein structure prediction
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
Alessandro Dal Palù, Agostino Dovier, Feder...
263
Voted
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
140
Voted
CADE
2011
Springer
14 years 3 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
138
Voted
PPDP
1999
Springer
15 years 7 months ago
Constraint Programming in OPL
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
Pascal Van Hentenryck, Laurent Michel, Laurent Per...