Sciweavers

484 search results - page 20 / 97
» The number of convex permutominoes
Sort
View
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
CCCG
2007
13 years 11 months ago
On the Fewest Nets Problem for Convex Polyhedra
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
Val Pinciu
IJCV
1998
192views more  IJCV 1998»
13 years 9 months ago
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
Peter N. Belhumeur, David J. Kriegman
ICASSP
2011
IEEE
13 years 1 months ago
Distributed beamforming for multiuser peer-to-peer and multi-group multicasting relay networks
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
Nils Bornhorst, Marius Pesavento, Alex B. Gershman