4886 search results - page 417 / 978 » Approximate Data Exchange |
222
click to vote
TKDE
2012
13 years 9 months ago
2012
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
133
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
290
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
169
click to vote
GRAPHITE
2006
ACM
16 years 22 days ago
2006
ACM
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
172
click to vote
SACMAT
2010
ACM
15 years 11 months ago
2010
ACM
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...