3038 search results - page 200 / 608 » High-Speed Function Approximation |
170
Voted
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
163
click to vote
IDA
2002
Springer
15 years 6 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
189
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
196
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
286
click to vote
SIAMIS
2010
15 years 1 months ago
2010
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...