453 search results - page 65 / 91 » Tight bounds for the partial-sums problem |
PODC
2005
ACM
14 years 4 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
LICS
1994
IEEE
14 years 3 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
CVPR
2009
IEEE
15 years 6 months ago
2009
IEEE
We address the problem of parameter estimation in presence
of both uncertainty and outlier noise. This is a common
occurrence in computer vision: feature localization
is perform...
SIGMOD
2006
ACM
14 years 11 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...