Sciweavers

973 search results - page 46 / 195
» New Bounds on Crossing Numbers
Sort
View
TMI
2010
94views more  TMI 2010»
14 years 10 months ago
Theoretical Bounds and System Design for Multipinhole SPECT
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
Peter Nillius, Mats Danielsson
AAAI
2006
15 years 1 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
LCTRTS
2010
Springer
15 years 1 months ago
Resilience analysis: tightening the CRPD bound for set-associative caches
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
Sebastian Altmeyer, Claire Maiza, Jan Reineke
DCG
2006
97views more  DCG 2006»
14 years 12 months ago
k-Sets in Four Dimensions
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
Jirí Matousek, Micha Sharir, Shakhar Smorod...
SIROCCO
2004
15 years 1 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein