Sciweavers

565 search results - page 10 / 113
» Geometry of Upper Probabilities
Sort
View
STOC
1999
ACM
81views Algorithms» more  STOC 1999»
15 years 4 months ago
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...
IPMU
2010
Springer
15 years 1 months ago
On Nonparametric Predictive Inference for Ordinal Data
Abstract. Nonparametric predictive inference (NPI) is a powerful frequentist statistical framework based only on an exchangeability assumption for future and past observations, mad...
Frank P. A. Coolen, Pauline Coolen-Schrijner, Taha...
COLT
2008
Springer
15 years 1 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ECCV
2006
Springer
15 years 3 months ago
The Space of Multibody Fundamental Matrices: Rank, Geometry and Projection
We study the rank and geometry of the multibody fundamental matrix, a geometric entity characterizing the two-view geometry of dynamic scenes consisting of multiple rigidbody moti...
Xiaodong Fan, René Vidal
JCT
2007
95views more  JCT 2007»
14 years 11 months ago
Codegree problems for projective geometries
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
Peter Keevash, Yi Zhao