Sciweavers

265 search results - page 42 / 53
» Genericity in Graphics Recognition Algorithms
Sort
View
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 3 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...
PTS
2008
152views Hardware» more  PTS 2008»
14 years 11 months ago
Model-Based Testing Service on the Web
Abstract. Model-based testing (MBT) seems to be technically superior to conventional test automation. However, MBT features some difficulties that can hamper its deployment in indu...
Antti Jääskeläinen, Mika Katara, An...
NIPS
2007
14 years 11 months ago
Measuring Neural Synchrony by Message Passing
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
Justin Dauwels, François B. Vialatte, Tomas...
GBRPR
2005
Springer
15 years 3 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
CORR
2010
Springer
69views Education» more  CORR 2010»
14 years 10 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...