292 search results - page 17 / 59 » Are Stable Instances Easy |
107
click to vote
AAAI
2008
15 years 3 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
AAAI
2004
15 years 2 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
103
Voted
NIME
2001
Springer
15 years 5 months ago
2001
Springer
Passive RF Tagging can provide an attractive medium for development of free-gesture musical interfaces. This was initially explored in our Musical Trinkets installation, which use...
115
Voted
RECOMB
2009
Springer
15 years 7 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
EMNLP
2008
15 years 2 months ago
2008
Bootstrapping has a tendency, called semantic drift, to select instances unrelated to the seed instances as the iteration proceeds. We demonstrate the semantic drift of bootstrapp...