523 search results - page 57 / 105 » On the Signal Bounding Problem in Timing Analysis |
176
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
106
click to vote
INFOCOM
1993
IEEE
15 years 5 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
128
click to vote
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
128
click to vote
ICS
2010
Tsinghua U.
15 years 5 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
109
click to vote
EDM
2010
15 years 2 months ago
2010
Functional magnetic resonance imaging (fMRI) data were collected while students worked with a tutoring system that taught an algebra isomorph. A cognitive model predicted the distr...