179 search results - page 20 / 36 » Space Bounded Computations: Review And New Separation Result... |
85
Voted
CVPR
2008
IEEE
15 years 5 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
65
Voted
STACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
COMBINATORICS
1999
14 years 10 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
90
Voted
ICCV
2007
IEEE
16 years 13 days ago
2007
IEEE
This paper aims to introduce the robustness against noise into the spectral clustering algorithm. First, we propose a warping model to map the data into a new space on the basis o...