Sciweavers

3820 search results - page 442 / 764
» Bounded Model Debugging
Sort
View
CCS
2009
ACM
15 years 10 months ago
A framework for quantitative security analysis of machine learning
We propose a framework for quantitative security analysis of machine learning methods. Key issus of this framework are a formal specification of the deployed learning model and a...
Pavel Laskov, Marius Kloft
120
Voted
DATE
2009
IEEE
118views Hardware» more  DATE 2009»
15 years 10 months ago
Gate sizing for large cell-based designs
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...
Stephan Held
FOCS
2009
IEEE
15 years 10 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
138
Voted
FOCS
2009
IEEE
15 years 10 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
ICC
2009
IEEE
111views Communications» more  ICC 2009»
15 years 10 months ago
A Study of the Percolation Threshold for k-Collaborative Wireless Networks
—How to efficiently use the air interface is a crucial issue in wireless networks. In order to improve the performance, mechanisms have been proposed to improve the reach and th...
Cédric Westphal