Sciweavers

315 search results - page 8 / 63
» Eigenvalue bounds for independent sets
Sort
View
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
14 years 4 months ago
A set-membership approach to consensus problems with bounded measurement errors
— This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The protocols taken into account adopt an updating rule based either on const...
Andrea Garulli, Antonio Giannitrapani
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 10 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
14 years 4 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 10 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
FCT
2007
Springer
14 years 4 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...