3019 search results - page 34 / 604 » Approximating the Domatic Number |
108
click to vote
PERVASIVE
2011
Springer
14 years 2 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 ...
124
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
120
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
169
click to vote
DC
2011
13 years 11 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...