10901 search results - page 164 / 2181 » Approximations in Distributed Optimization |
165
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
157
click to vote
NIPS
2001
15 years 7 months ago
2001
We describe the g-factor which relates probability distributions on image features to distributions on the images themselves. The g-factor depends only on our choice of features a...
175
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
210
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
165
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...