1021 search results - page 59 / 205 » Fast Approximate PCPs |
127
click to vote
ASPDAC
2010
ACM
14 years 12 months ago
2010
ACM
The gramian approximation methods have been proposed recently to overcome the high computing costs of classical balanced truncation based reduction methods. But those methods typi...
136
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
ADC
2008
Springer
15 years 8 months ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
130
click to vote
SIGMETRICS
2000
ACM
15 years 6 months ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
120
click to vote
SGP
2003
15 years 3 months ago
2003
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...