198 search results - page 28 / 40 » Evidence-invariant Sensitivity Bounds |
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
Current automated market makers over binary events suffer from two problems that make them impractical. First, they are unable to adapt to liquidity, so trades cause prices to mo...
FM
2001
Springer
15 years 3 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ICMCS
2000
IEEE
15 years 3 months ago
2000
IEEE
In this paper, we propose to use a simple packet servicing algorithm suitable for servicing bursty real-time multimedia traffic streams in packet-switched networks. These real-tim...
EDCC
1999
Springer
15 years 3 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
CVRMED
1997
Springer
1997
Springer
Geometric constraint analysis and synthesis: methods for improving shape-based registration accuracy
15 years 3 months ago
Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establis...