927 search results - page 142 / 186 » A Data Abstraction Alternative to Data Structure Algorithm M... |
105
click to vote
DAGM
2010
Springer
15 years 23 days ago
2010
Springer
The selection of an optical flow method is mostly a choice from among accuracy, efficiency and ease of implementation. While variational approaches tend to be more accurate than lo...
CGF
2007
15 years 17 days ago
2007
In this paper, we propose a robust and efficient Lagrangian approach for modeling dynamic interfaces between different materials undergoing large deformations and topology change...
126
Voted
TSP
2010
14 years 7 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
153
Voted
WADS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
108
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...