811 search results - page 60 / 163 » Avoiding Approximate Squares |
AMC
2005
13 years 7 months ago
2005
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
DAM
2011
13 years 2 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
PERVASIVE
2011
Springer
12 years 10 months ago
2011
Springer
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
INFOCOM
1997
IEEE
13 years 12 months ago
1997
IEEE
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a new algorithm for minimizing a convex loss-function subject to regularization. Our framework applies to numerous problems in machine learning and statistics; notably,...