1021 search results - page 50 / 205 » Fast Approximate PCPs |
131
click to vote
SIGPRO
2010
15 years 9 days ago
2010
The recovery of signal parameters from noisy sampled data is a fundamental problem in digital signal processing. In this paper, we consider the following spectral analysis problem...
129
click to vote
PODS
2002
ACM
16 years 2 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
155
click to vote
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
123
click to vote
VISUALIZATION
1997
IEEE
15 years 6 months ago
1997
IEEE
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
119
click to vote
CAV
2006
Springer
15 years 5 months ago
2006
Springer
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...