SIAMCOMP
2002
13 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
TOC
2008
13 years 4 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
APAL
2006
13 years 4 months ago
2006
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
ICNP
1996
IEEE
13 years 8 months ago
1996
IEEE
Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales. In this paper, we examine a mechanism that ...
ISCOPE
1998
Springer
13 years 8 months ago
1998
Springer
In this paper we present a parallel runtime substrate that supports a global addressing scheme, object mobility, and automatic message forwarding required for the implementation o...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
FOCS
2003
IEEE
13 years 9 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
POPL
2003
ACM
14 years 4 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
Tracking is frequently considered a frame-to-frame operation. As such, object recognition techniques are generally too slow to be used for tracking. There are domains, however, wh...