3038 search results - page 335 / 608 » High-Speed Function Approximation |
161
click to vote
SWAT
2004
Springer
16 years 4 hour ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
208
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
204
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
193
click to vote
SAGT
2009
Springer
15 years 11 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...
189
click to vote
BTW
2007
Springer
15 years 10 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...