3991 search results - page 481 / 799 » Bounding homogeneous models |
204
Voted
PODS
2001
ACM
16 years 7 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
179
Voted
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be...
165
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
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...
162
Voted
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—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...
176
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— 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...