Sciweavers

2996 search results - page 87 / 600
» Numberings and Randomness
Sort
View
107
Voted
IJCAI
2007
15 years 2 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...
CPC
2007
125views more  CPC 2007»
15 years 20 days ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
92
Voted
RSA
2008
84views more  RSA 2008»
15 years 4 days ago
Random partitions with restricted part sizes
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
William M. Y. Goh, Pawel Hitczenko
106
Voted
ICML
2007
IEEE
16 years 1 months ago
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
Arik Azran
95
Voted
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 7 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala