Sciweavers

1672 search results - page 25 / 335
» Tightness problems in the plane
Sort
View
ICDCS
2010
IEEE
13 years 5 months ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
CVPR
2009
IEEE
15 years 2 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
LATA
2009
Springer
14 years 2 months ago
Tiling the Plane with a Fixed Number of Polyominoes
Deciding whether a finite set of polyominoes tiles the plane is undecidable by reduction from the Domino problem. In this paper, we prove that the problem remains undecidable if t...
Nicolas Ollinger
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 7 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
CVIU
2007
152views more  CVIU 2007»
13 years 7 months ago
A random sampling strategy for piecewise planar scene segmentation
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
Adrien Bartoli