1381 search results - page 82 / 277 » Computational Complexity of Constraint Satisfaction |
137
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
126
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A framework for the regularized estimation of nonuniform dimensionality and density in high dimensional data is introduced in this work. This leads to learning stratifications, th...
135
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
119
click to vote
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
114
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...