4066 search results - page 4 / 814 » Almost Complete Sets |
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
ENDM
2007
13 years 7 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Experimental processes to collect and process proteomics data are increasingly complex, while the computational methods to assess the quality and significance of these data remain...
APAL
1998
13 years 7 months ago
1998
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
IMA
2009
Springer
14 years 2 months ago
2009
Springer
Let f : F n 2 → F n 2 be an almost perfect nonlinear function (APN). The set Df := {(a, b) : f(x + a) − f(x) = b has two solutions} can be used to distinguish APN functions up ...