3932 search results - page 601 / 787 » Adaptive Index Structures |
168
click to vote
AAAI
2000
15 years 5 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
136
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
152
click to vote
VCIP
2003
15 years 5 months ago
2003
We propose a novel approach that uses disparity-compensated lifting for wavelet compression of light fields. Disparity compensation is incorporated into the lifting structure for...
152
click to vote
COLING
2000
15 years 5 months ago
2000
The results of an experiment are presented in which an approach for robust parsing has been applied incrementally. They confirm that due to the robust nature of the underlying tec...
131
click to vote
IWFM
1998
15 years 5 months ago
1998
We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on ...