4860 search results - page 226 / 972 » SNPs Problems, Complexity, and Algorithms |
AIEDAM
2008
13 years 11 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
ALGORITHMICA
2008
13 years 11 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
NICSO
2010
Springer
14 years 2 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
ICMCS
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
HAPTICS
2007
IEEE
14 years 5 months ago
2007
IEEE
Geometric (proxy-based) haptic rendering algorithms are widely used in impedance-type haptic rendering. Such methods are useful for developing complex virtual environment because ...