1957 search results - page 110 / 392 » Approximate algorithms for neural-Bayesian approaches |
100
click to vote
VRST
2003
ACM
15 years 3 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
101
click to vote
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
118
click to vote
ESA
1995
Springer
15 years 1 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...