Sciweavers

5169 search results - page 45 / 1034
» Locality approximation using time
Sort
View
CGI
2006
IEEE
14 years 4 months ago
An Approximate Image-Space Approach for Real-Time Rendering of Deformable Translucent Objects
Although lots of works have been engaged in interactive and realistic rendering of translucent materials, efficient processing for deformable models remains a challenging problem...
Yi Gong, Wei Chen, Long Zhang, Yun Zeng, Qunsheng ...
ICTCS
2005
Springer
14 years 4 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
TON
2008
119views more  TON 2008»
13 years 10 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
13 years 10 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
15 years 6 days ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...