Sciweavers

9842 search results - page 1961 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SPAA
2010
ACM
14 years 8 days ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 8 days ago
Interactive privacy via the median mechanism
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
Aaron Roth, Tim Roughgarden
EUROCRYPT
2010
Springer
14 years 8 days ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 8 days ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 8 days ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
« Prev « First page 1961 / 1969 Last » Next »