2168 search results - page 398 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
CL
2012
Springer
11 years 10 months ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
RECOMB
2010
Springer
13 years 9 months ago
2010
Springer
Immense amounts of raw instrument data (i.e., images of fluorescence) are currently being generated using ultra high-throughput sequencing platforms. An important computational cha...