Sciweavers

11213 search results - page 2188 / 2243
» Low-contention data structures
Sort
View
OOPSLA
2004
Springer
14 years 2 months ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
PRICAI
2004
Springer
14 years 2 months ago
Shape Matching for Robot Mapping
We present a novel geometric model for robot mapping based on shape. Shape similarity measure and matching techniques originating from computer vision are specially redesigned for ...
Diedrich Wolter, Longin Jan Latecki
UPP
2004
Springer
14 years 2 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
VEE
2010
ACM
238views Virtualization» more  VEE 2010»
14 years 2 months ago
Optimizing crash dump in virtualized environments
Crash dump, or core dump is the typical way to save memory image on system crash for future offline debugging and analysis. However, for typical server machines with likely abund...
Yijian Huang, Haibo Chen, Binyu Zang
CSB
2003
IEEE
118views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Automated Protein NMR Resonance Assignments
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protei...
Xiang Wan, Dong Xu, Carolyn M. Slupsky, Guohui Lin
« Prev « First page 2188 / 2243 Last » Next »