4171 search results - page 370 / 835 » Choice numbers of graphs |
213
click to vote
ECCC
2010
15 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
186
click to vote
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
187
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Most modern computer vision systems for high-level
tasks, such as image classification, object recognition and
segmentation, are based on learning algorithms that are
able to se...
167
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of n...
181
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...