Sciweavers

1538 search results - page 63 / 308
» Relative Randomness and Cardinality
Sort
View
ECML
2006
Springer
15 years 1 months ago
Multiple-Instance Learning Via Random Walk
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
Dong Wang, Jianmin Li, Bo Zhang
PAMI
1998
127views more  PAMI 1998»
14 years 9 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
JCO
2010
97views more  JCO 2010»
14 years 8 months ago
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
Andrzej Dudek, Joanna Polcyn, Andrzej Rucinski
CVPR
2012
IEEE
13 years 6 days ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
GTTSE
2007
Springer
15 years 4 months ago
Design Space of Heterogeneous Synchronization
Abstract. This tutorial explores the design space of heterogeneous synchronization, which is concerned with establishing consistency among artifacts that conform to different sche...
Michal Antkiewicz, Krzysztof Czarnecki