2434 search results - page 261 / 487 » Algorithmic Randomness of Closed Sets |
177
click to vote
ALT
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
203
click to vote
PAMI
2010
15 years 2 months ago
2010
The notion of using context information for solving high-level vision and medical image segmentation problems has been increasingly realized in the field. However, how to learn a...
133
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...
173
click to vote
EDCC
2010
Springer
15 years 8 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
129
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...