Sciweavers

2498 search results - page 335 / 500
» Data Structures with Unpredictable Timing
Sort
View
IWMM
2000
Springer
135views Hardware» more  IWMM 2000»
15 years 10 months ago
Conservative Garbage Collection for General Memory Allocators
This paper explains a technique that integrates conservative garbage collection on top of general memory allocators. This is possible by using two data structures named malloc-tab...
Gustavo Rodriguez-Rivera, Michael Spertus, Charles...
GIS
1995
ACM
15 years 10 months ago
A Window Retrieval Algorithm for Spatial Databases Using Quadtrees
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Walid G. Aref, Hanan Samet
BMVC
2001
15 years 8 months ago
Robust Registration of 2D and 3D Point Sets
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
Andrew W. Fitzgibbon
AAAI
2007
15 years 8 months ago
Mapping and Revising Markov Logic Networks for Transfer Learning
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...
FLAIRS
2008
15 years 8 months ago
Learning Dynamic Naive Bayesian Classifiers
Hidden Markov models are a powerful technique to model and classify temporal sequences, such as in speech and gesture recognition. However, defining these models is still an art: ...
Miriam Martínez, Luis Enrique Sucar