4218 search results - page 37 / 844 » Complete sets of cooperations |
CIVR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Keypics are graphical metadata intended for indexing of images on the Internet. They are conceived as hand-drawn sketches, not restricted to a definite set. An obvious d...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
ENDM
2007
13 years 7 months ago
2007
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
DM
1998
13 years 7 months ago
1998
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...