Sciweavers

110 search results - page 22 / 22
» Patterson-Wiedemann construction revisited
Sort
View
ICDCS
2008
IEEE
14 years 21 days ago
Measurement Manipulation and Space Selection in Network Coordinates
Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate sy...
Cristian Lumezanu, Neil Spring
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
13 years 11 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ESOP
2004
Springer
13 years 11 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
SIGCOMM
2010
ACM
13 years 6 months ago
The case for active device drivers
We revisit the device-driver architecture supported by the majority of operating systems, where a driver is a passive object that does not have its own thread of control and is on...
Leonid Ryzhyk, Yanjin Zhu, Gernot Heiser
BMCBI
2004
119views more  BMCBI 2004»
13 years 6 months ago
Genome SEGE: A database for 'intronless' genes in eukaryotic genomes
Background: A number of completely sequenced eukaryotic genome data are available in the public domain. Eukaryotic genes are either 'intron containing' or 'intronle...
Meena K. Sakharkar, Pandjassarame Kangueane