Sciweavers

10608 search results - page 595 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
AAAI
2006
15 years 8 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
ICCV
2007
IEEE
16 years 9 months ago
Spherical-Homoscedastic Shapes
Shape analysis requires invariance under translation, scale and rotation. Translation and scale invariance can be realized by normalizing shape vectors with respect to their mean ...
Onur C. Hamsici, Aleix M. Martínez
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
16 years 21 days ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
COMPGEOM
2008
ACM
15 years 9 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
ALT
2006
Springer
16 years 4 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen