3038 search results - page 255 / 608 » High-Speed Function Approximation |
206
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
155
click to vote
FOCS
2005
IEEE
16 years 9 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
193
click to vote
EMMCVPR
2005
Springer
16 years 6 days ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
166
Voted
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
Sparse Grids are the basis for efficient high dimensional approximation and have recently been applied successfully to predictive modelling. They are spanned by a collection of si...
184
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...