2004 search results - page 229 / 401 » Sampling from large graphs |
131
Voted
PDCN
2004
15 years 5 months ago
2004
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
160
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
136
Voted
PAMI
2006
15 years 3 months ago
2006
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
80
Voted
CLASSIFICATION
2004
15 years 3 months ago
2004
: We propose a new nonparametric family of oscillation heuristics for improving linear classifiers in the two-group discriminant problem. The heuristics are motivated by the intuit...
135
Voted
JMLR
2002
15 years 3 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...