Sciweavers

4860 search results - page 224 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 10 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
FOCS
1997
IEEE
14 years 3 months ago
Randomized and Deterministic Algorithms for the Dimension of Algebraic Varieties
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
Pascal Koiran
AMDO
2008
Springer
14 years 23 days ago
Autonomous Virtual Agents for Performance Evaluation of Tracking Algorithms
This paper describes a framework which exploits the use of computer animation to evaluate the performance of tracking algorithms. This can be achieved in two different, complementa...
Pau Baiget, F. Xavier Roca, Jordi Gonzàlez
ICTAI
1992
IEEE
14 years 2 months ago
Genetic Algorithms as a Tool for Feature Selection in Machine Learning
This paper describes an approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real world data. The appr...
Haleh Vafaie, Kenneth A. De Jong