Sciweavers

3208 search results - page 213 / 642
» A Lower Bound for Primality
Sort
View
AUTOMATICA
2004
147views more  AUTOMATICA 2004»
15 years 6 months ago
Interval analysis and dioid: application to robust controller design for timed event graphs
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
Mehdi Lhommeau, Laurent Hardouin, Bertrand Cottenc...
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
15 years 6 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
IPL
2010
80views more  IPL 2010»
15 years 5 months ago
Rate monotonic scheduling re-analysed
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...
Qiwen Xu, Naijun Zhan
JAIR
2011
114views more  JAIR 2011»
14 years 9 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
JMLR
2012
13 years 9 months ago
Minimax rates for homology inference
Often, high dimensional data lie close to a low-dimensional submanifold and it is of interest to understand the geometry of these submanifolds. The homology groups of a manifold a...
Sivaraman Balakrishnan, Alessandro Rinaldo, Don Sh...