4860 search results - page 305 / 972 » SNPs Problems, Complexity, and Algorithms |
116
Voted
LOGCOM
2007
15 years 3 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
123
click to vote
IJCAI
2007
15 years 4 months ago
2007
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
195
Voted
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
122
Voted
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Sparse representation has found applications in numerous domains and recent developments have been focused on the convex relaxation of the 0-norm minimization for sparse coding (i...
140
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...