Sciweavers

2030 search results - page 393 / 406
» Extremal Problems of Information Combining
Sort
View
ICS
2001
Tsinghua U.
14 years 11 days ago
Integrating superscalar processor components to implement register caching
A large logical register file is important to allow effective compiler transformations or to provide a windowed space of registers to allow fast function calls. Unfortunately, a l...
Matt Postiff, David Greene, Steven E. Raasch, Trev...
LPAR
2001
Springer
14 years 11 days ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
FOCS
2000
IEEE
14 years 10 days ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SSIAI
2000
IEEE
14 years 9 days ago
A New Bayesian Relaxation Framework for the Estimation and Segmentation of Multiple Motions
In this paper we propose a new probabilistic relaxation framework to perform robust multiple motion estimation and segmentation from a sequence of images. Our approach uses displa...
Alexander Strehl, Jake K. Aggarwal
ECOOP
1999
Springer
14 years 6 days ago
Visualizing Reference Patterns for Solving Memory Leaks in Java
Many Java programmers believe they do not have to worry about memory management because of automatic garbage collection. In fact, many Java programs run out of memory unexpectedly ...
Wim De Pauw, Gary Sevitsky