Sciweavers

364 search results - page 49 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
CCCG
2008
13 years 10 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
IJCAI
2003
13 years 9 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
ECCC
2010
89views more  ECCC 2010»
13 years 8 months ago
Estimating the unseen: A sublinear-sample canonical estimator of distributions
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
Gregory Valiant, Paul Valiant
IJCV
2000
149views more  IJCV 2000»
13 years 8 months ago
Recognition without Correspondence using Multidimensional Receptive Field Histograms
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...
Bernt Schiele, James L. Crowley
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking