6315 search results - page 434 / 1263 » Approximating Solution Structure |
184
click to vote
IJCV
2006
15 years 7 months ago
2006
Standard approaches to stereo correspondence have difficulty when scene structure does not lie in or near the frontal parallel plane, in part because an orientation disparity as we...
214
click to vote
NJC
2000
15 years 7 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
199
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
195
click to vote
SEFM
2006
IEEE
16 years 1 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
250
click to vote
KDD
2004
ACM
16 years 29 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...