5169 search results - page 45 / 1034 » Locality approximation using time |
123
click to vote
CGI
2006
IEEE
15 years 8 months ago
2006
IEEE
Although lots of works have been engaged in interactive and realistic rendering of translucent materials, efficient processing for deformable models remains a challenging problem...
114
click to vote
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
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...
118
Voted
TON
2008
15 years 2 months ago
2008
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...
141
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
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,...
205
Voted
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
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...