Sciweavers

1066 search results - page 189 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
GIS
2007
ACM
15 years 10 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
COMPGEOM
2006
ACM
15 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
CG
2004
Springer
14 years 9 months ago
3D video fragments: dynamic point samples for real-time free-viewpoint video
We present 3D video fragments, a dynamic point sample framework for real-time free-viewpoint video. By generalizing 2D video pixels towards 3D irregular point samples we combine t...
Stephan Würmlin, Edouard Lamboray, Markus H. ...
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 9 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
LOGCOM
1998
178views more  LOGCOM 1998»
14 years 9 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh