40 search results - page 7 / 8 » A New PAC Bound for Intersection-Closed Concept Classes |
ISPD
2005
ACM
13 years 11 months ago
2005
ACM
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
FOCS
2009
IEEE
14 years 10 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...