2168 search results - page 398 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
267
Voted
CL
2012
Springer
13 years 6 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...
161
Voted
EUROSYS
2006
ACM
16 years 18 days 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 ...
132
Voted
EUROGRAPHICS
2010
Eurographics
16 years 17 days 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...
125
Voted
ICS
2010
Tsinghua U.
16 years 27 days 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...
109
Voted
RECOMB
2010
Springer
15 years 5 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...