4860 search results - page 330 / 972 » SNPs Problems, Complexity, and Algorithms |
148
Voted
JMLR
2012
13 years 3 months ago
2012
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
98
Voted
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
116
click to vote
COSIT
2003
Springer
15 years 6 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...