457 search results - page 48 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
172
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
154
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
167
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
171
click to vote
MST
2002
15 years 5 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
169
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...