2745 search results - page 400 / 549 » A fast algorithm for computing large Fibonacci numbers |
151
click to vote
SIAMSC
2010
14 years 11 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
157
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
160
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
157
click to vote
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
157
click to vote
CVPR
2011
IEEE
15 years 7 days ago
2011
IEEE
Datasets are an integral part of contemporary object recognition research. They have been the chief reason for the considerable progress in the field, not just as source of large...