Sciweavers

13987 search results - page 239 / 2798
» The Two Guards Problem
Sort
View
TCS
2002
15 years 3 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat
NETWORKS
2010
15 years 2 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CVPR
2007
IEEE
16 years 6 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
ICIP
2006
IEEE
16 years 5 months ago
Signal Processing Problems and Algorithms in Display Side of 3DTV
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
Atanas P. Gotchev, Erdem Ulusoy, Gokhan Bora Esmer...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 4 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu