Sciweavers

160 search results - page 21 / 32
» On Planar Supports for Hypergraphs
Sort
View
IJCGA
2000
85views more  IJCGA 2000»
14 years 9 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
ICPR
2010
IEEE
14 years 8 months ago
Local Optical Operators for Subpixel Scene Analysis
In this paper we present a scene analysis technique with subpixel filtering based on dense coded light fields. Our technique computes alignment and optically projects analysis ...
Yves Jean
MOR
2010
111views more  MOR 2010»
14 years 8 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
FOCS
2010
IEEE
14 years 7 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
VR
2011
IEEE
192views Virtual Reality» more  VR 2011»
14 years 1 months ago
Continual surface-based multi-projector blending for moving objects
We introduce a general technique for blending imagery from multiple projectors on a tracked, moving, non-planar object. Our technique continuously computes visibility of pixels ov...
Peter Lincoln, Greg Welch, Henry Fuchs