680 search results - page 110 / 136 » Computational Complexity and Anytime Algorithm for Inconsist... |
EMSOFT
2004
Springer
14 years 1 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Acquiring and representing the 4D space of rays in the world (the light field) is important for many computer vision and graphics applications. Yet, light field acquisition is c...
ACST
2006
13 years 9 months ago
2006
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...