Sciweavers

1408 search results - page 67 / 282
» Dynamical Tensor Approximation
Sort
View
EOR
2007
117views more  EOR 2007»
13 years 9 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
TPDS
2008
120views more  TPDS 2008»
13 years 9 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
JMM2
2006
116views more  JMM2 2006»
13 years 10 months ago
Relighting of Dynamic Video
-- We present a novel method to relight video sequences for multimedia applications given known surface shape and original illumination. The method preserves fine visual details. I...
Péter Csákány, Adrian Hilton
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
On Turing machines, dynamical systems and the Atiyah problem
: We consider mixed Dirichlet-Robin problems on scale irregular domains. In particular, we study the asymptotic convergence of the solutions of elliptic problems with Robin boundar...
Lukasz Grabowski
GIS
1999
ACM
14 years 2 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas