2084 search results - page 62 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We study jitter control in networks with guaranteed quality of service (QoS) from the competitive analysis point of view: we propose on-line algorithms that control jitter and comp...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
174
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...