Sciweavers

185 search results - page 32 / 37
» Bounded-Curvature Path Normalization
Sort
View
OSDI
2004
ACM
14 years 7 months ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
SMI
2008
IEEE
198views Image Analysis» more  SMI 2008»
14 years 1 months ago
Anisotropic geodesic distance computation for parametric surfaces
The distribution of geometric features is anisotropic by its nature. Intrinsic properties of surfaces such as normal curvatures, for example, varies with direction. In this paper ...
Joon-Kyung Seong, Won-Ki Jeong, Elaine Cohen
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 28 days ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
ITC
1998
IEEE
94views Hardware» more  ITC 1998»
13 years 11 months ago
A method of serial data jitter analysis using one-shot time interval measurements
A method for measuring inter-symbol interference, duty cycle distortion, random jitter and periodic jitter is described. The Blackman-Tukey method of signal analysis is used. This...
Jan B. Wilstrup
CGO
2007
IEEE
13 years 11 months ago
Shadow Profiling: Hiding Instrumentation Costs with Parallelism
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling profilers incur negligible overhead, but the information they collect is consequen...
Tipp Moseley, Alex Shye, Vijay Janapa Reddi, Dirk ...