192 search results - page 25 / 39 » Nondeterminism in Constructive Z |
106
click to vote
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
140
click to vote
ANCS
2009
ACM
14 years 9 months ago
2009
ACM
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
ICML
2004
IEEE
16 years 15 days ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...
128
click to vote
SMA
2009
ACM
15 years 6 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...