2814 search results - page 197 / 563 » Competitive Analysis of Distributed Algorithms |
99
Voted
TPDS
2010
14 years 11 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
105
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
145
click to vote
SDM
2012
SIAM
13 years 3 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
103
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i.d. s...
85
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...