2069 search results - page 14 / 414 » Linear time algorithms for Clobber |
120
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
171
Voted
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
126
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
126
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
114
Voted
GD
2003
Springer
15 years 8 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...