Sciweavers

11212 search results - page 2201 / 2243
» Semi-persistent Data Structures
Sort
View
SPAA
2009
ACM
15 years 11 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
ICDCS
2009
IEEE
15 years 11 months ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
EUROSYS
2009
ACM
15 years 11 months ago
Ksplice: automatic rebootless kernel updates
Ksplice allows system administrators to apply patches to their operating system kernels without rebooting. Unlike previous hot update systems, Ksplice operates at the object code ...
Jeff Arnold, M. Frans Kaashoek
151
Voted
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
Two-Colored Pixels
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
Darko Pavic and Leif Kobbelt
127
Voted
ICCD
2006
IEEE
97views Hardware» more  ICCD 2006»
15 years 11 months ago
Pesticide: Using SMT Processors to Improve Performance of Pointer Bug Detection
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
Jin-Yi Wang, Yen-Shiang Shue, T. N. Vijaykumar, Sa...
« Prev « First page 2201 / 2243 Last » Next »