779 search results - page 22 / 156 » Algorithms for the Sample Mean of Graphs |
FLAIRS
2007
15 years 2 days ago
2007
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
112
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
GD
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
AUSAI
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...