1431 search results - page 179 / 287 » The complexity of random ordered structures |
129
Voted
SIROCCO
2008
15 years 4 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
145
Voted
AAAI
2011
14 years 3 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
132
click to vote
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
217
click to vote
ICDE
2004
IEEE
16 years 4 months ago
2004
IEEE
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
76
Voted
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Diffusion-type algorithms have been integrated in recent years successfully into the toolbox of image processing. We introduce a new more flexible and powerful family of parabolic...