Sciweavers

4679 search results - page 133 / 936
» Modeling When Connections Are the Problem
Sort
View
118
Voted
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 11 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
AAAI
1994
15 years 3 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
SIAMIS
2010
171views more  SIAMIS 2010»
14 years 8 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
106
Voted
IOR
2006
126views more  IOR 2006»
15 years 1 months ago
A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
We consider the problem of radiation therapy treatment planning for cancer patients. During radiation therapy, beams of radiation pass through a patient, killing both cancerous an...
H. Edwin Romeijn, Ravindra K. Ahuja, James F. Demp...
136
Voted
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
15 years 2 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...