4541 search results - page 35 / 909 » Cache-Oblivious Algorithms and Data Structures |
DAWAK
2005
Springer
14 years 12 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
ICCV
2007
IEEE
15 years 23 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
WADS
1997
Springer
14 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
IEEEMSP
2002
IEEE
14 years 11 months ago
2002
IEEE
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
FPLE
1995
14 years 10 months ago
1995
In this paper, we make a proposal for a second year course on advanced programming, based on the functional paradigm. It assumes the existence of a first course on programming, al...