Sciweavers

140 search results - page 9 / 28
» soda 2010
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
13 years 8 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
SERVICES
2010
130views more  SERVICES 2010»
13 years 12 months ago
Heterogeneous Service Selection Based on Formal Concept Analysis
In this paper, we propose an approach based on Formal Concept Analysis in order to organize the services registry at runtime and to allow the "best" service selection am...
Stéphanie Chollet, Vincent Lestideau, Phili...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
13 years 8 months ago
Differential Privacy in New Settings
Differential privacy is a recent notion of privacy tailored to the problem of statistical disclosure control: how to release statistical information about a set of people without ...
Cynthia Dwork
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 7 months ago
Faster exponential time algorithms for the shortest vector problem
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
Daniele Micciancio, Panagiotis Voulgaris
SODA
2010
ACM
234views Algorithms» more  SODA 2010»
14 years 7 months ago
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
David Gamarnik, David Goldberg, Theophane Weber