927 search results - page 70 / 186 » A Data Abstraction Alternative to Data Structure Algorithm M... |
150
Voted
ECCV
1994
Springer
16 years 4 months ago
1994
Springer
Abstract. This paper presents a new algorithm for structure from motion from an arbitrary number of tracked features over an arbitrary number of images, which possesses several adv...
112
click to vote
HIPC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
123
click to vote
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
Model fields are specification-only fields that encode abstractions of the concrete state of a data structure. They allow specifications to describe the behavior of object-oriented...
131
Voted
CONCUR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
122
Voted
RECOMB
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. Recent advances in high-throughput experimental techniques have enabled the production of a wealth of protein interaction data, rich in both quantity and variety. While t...