Sciweavers

4066 search results - page 43 / 814
» Almost Complete Sets
Sort
View
BMCBI
2005
81views more  BMCBI 2005»
13 years 10 months ago
Evolutionary sequence analysis of complete eukaryote genomes
Background: Gene duplication and gene loss during the evolution of eukaryotes have hindered attempts to estimate phylogenies and divergence times of species. Although current meth...
Jaime E. Blair, Prachi Shah, S. Blair Hedges
CIVR
2005
Springer
102views Image Analysis» more  CIVR 2005»
14 years 3 months ago
A Complete Keypics Experiment with Size Functions
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...
Andrea Cerri, Massimo Ferri, Daniela Giorgi
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
13 years 11 months ago
On the rectilinear crossing number of complete graphs
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...
Uli Wagner
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 10 months ago
Exact Matrix Completion via Convex Optimization
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...
Emmanuel J. Candès, Benjamin Recht
ENDM
2007
104views more  ENDM 2007»
13 years 10 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
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 ...
Jirí Fink