3931 search results - page 78 / 787 » Separation logic and abstraction |
185
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
211
click to vote
SIGSOFT
2003
ACM
16 years 2 days ago
2003
ACM
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
154
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...
238
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
176
click to vote
ICA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...