4886 search results - page 134 / 978 » Approximate Data Exchange |
ADCM
2010
15 years 6 months ago
2010
A variant of the classical C1 Powell-Sabin-12 macro-element is defined that has the same approximation power, but has fewer degrees of freedom and only requires vertex data. The sa...
152
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
166
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
210
click to vote
WADS
2007
Springer
16 years 4 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
169
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...