Sciweavers

2434 search results - page 99 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 3 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
120
Voted
COLT
2005
Springer
15 years 9 months ago
Separating Models of Learning from Correlated and Uncorrelated Data
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andr...
130
Voted
LATIN
2004
Springer
15 years 8 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
117
Voted
DCC
2004
IEEE
16 years 3 months ago
Distortion-Optimal Transmission of Progressive Images over Channels with Random Bit Errors and Packet Erasures
We present a statistical optimization framework for solving the end-to-end problem of progressive transmission of images over noisy channels. We consider the impacts of transmissi...
Homayoun Yousefi'zadeh, Hamid Jafarkhani, Farzad E...
ICONIP
2008
15 years 4 months ago
The Diversity of Regression Ensembles Combining Bagging and Random Subspace Method
Abstract. The concept of Ensemble Learning has been shown to increase predictive power over single base learners. Given the bias-variancecovariance decomposition, diversity is char...
Alexandra Scherbart, Tim W. Nattkemper