3172 search results - page 53 / 635 » On the Random-Self-Reducibility of Complete Sets |
90
Voted
IJCGA
2006
15 years 21 days ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
125
click to vote
FOIKS
2008
Springer
15 years 2 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
110
Voted
BMCBI
2005
15 years 18 days ago
2005
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...
99
Voted
SODA
2003
ACM
15 years 2 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...
108
Voted
CORR
2008
Springer
15 years 24 days 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...