6110 search results - page 416 / 1222 » Approximate Computing |
182
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
188
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
187
click to vote
ICAC
2007
IEEE
16 years 1 months ago
2007
IEEE
— The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive...
161
click to vote
FOCS
2005
IEEE
16 years 13 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...
168
click to vote
ICCS
2003
Springer
16 years 1 days 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...