Sciweavers

569 search results - page 23 / 114
» An Empirical Study of Structural Constraint Solving Techniqu...
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
CP
2003
Springer
14 years 17 days ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
CONSTRAINTS
1998
120views more  CONSTRAINTS 1998»
13 years 7 months ago
Constrained Graph Layout
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
Weiqing He, Kim Marriott
KCAP
2005
ACM
14 years 27 days ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
BIBM
2008
IEEE
172views Bioinformatics» more  BIBM 2008»
14 years 1 months ago
Boosting Methods for Protein Fold Recognition: An Empirical Comparison
Protein fold recognition is the prediction of protein’s tertiary structure (Fold) given the protein’s sequence without relying on sequence similarity. Using machine learning t...
Yazhene Krishnaraj, Chandan K. Reddy