2434 search results - page 83 / 487 » Algorithmic Randomness of Closed Sets |
129
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
119
Voted
TSP
2010
14 years 10 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
124
click to vote
ACMSE
2005
ACM
15 years 9 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
154
Voted
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
109
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...