Results 21  30
of
790,374
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 427 (0 self)
 Add to MetaCart
strictly increases the set of functions which are known to be polynomially learnable, in the sense of Valiant (1984). Our proof is constructive: we present an algorithm which can efficiently construct an element of kDL consistent with a given set of examples, if one exists.
Robust Characterizations of Polynomials with Applications to Program Testing
, 1996
"... The study of selftesting and selfcorrecting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization for polynomials. From this characterization, we get the following applications. ..."
Abstract

Cited by 361 (38 self)
 Add to MetaCart
The study of selftesting and selfcorrecting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization for polynomials. From this characterization, we get the following applications.
Orthogonal Polynomials of Several Variables
 Encyclopedia of Mathematics and its Applications
, 2001
"... Abstract. We report on the recent development on the general theory of orthogonal polynomials in several variables, in which results parallel to the theory of orthogonal polynomials in one variable are established using a vectormatrix notation. 1 ..."
Abstract

Cited by 235 (44 self)
 Add to MetaCart
Abstract. We report on the recent development on the general theory of orthogonal polynomials in several variables, in which results parallel to the theory of orthogonal polynomials in one variable are established using a vectormatrix notation. 1
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs
Cones of matrices and setfunctions and 01 optimization
 SIAM JOURNAL ON OPTIMIZATION
, 1991
"... It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop a general method to construct higherdimensional polyhedra (or, in some cases, convex sets) whose projection a ..."
Abstract

Cited by 346 (7 self)
 Add to MetaCart
approximates the convex hull of 01 valued solutions of a system of linear inequalities. An important feature of these approximations is that one can optimize any linear objective function over them in polynomial time. In the special case of the vertex packing polytope, we obtain a sequence of systems
Orthogonal Polynomials
 American Math. Soc. Colloq. Publns
, 2005
"... of the mfunction in the theory of orthogonal ..."
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 370 (9 self)
 Add to MetaCart
, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum
Verbs and Adverbs: Multidimensional Motion Interpolation Using Radial Basis Functions
 IEEE Computer Graphics and Applications
, 1998
"... This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions derived from live motion capture or produced through traditional animation tools. These motions can be characterized by emoti ..."
Abstract

Cited by 351 (5 self)
 Add to MetaCart
them, allowing an animated figure to exhibit a substantial repertoire of expressive behaviors. A combination of radial basis functions and low order polynomials is used to create the interpolation space between example motions. Inverse kinematic constraints are used to augment the interpolations
ORTHOGONAL POLYNOMIALS FOR THE
"... Abstract. This is a continuation of our previous investigations on polynomials orthogonal with respect to the linear functional L: P → C, where L = ∫ 1−1 p(x) dµ(x), dµ(x) = (1 − x2)λ−1/2 exp(iζx) dx, and P is a linear space of all algebraic polynomials. Here, we prove an extension of our previo ..."
Abstract
 Add to MetaCart
Abstract. This is a continuation of our previous investigations on polynomials orthogonal with respect to the linear functional L: P → C, where L = ∫ 1−1 p(x) dµ(x), dµ(x) = (1 − x2)λ−1/2 exp(iζx) dx, and P is a linear space of all algebraic polynomials. Here, we prove an extension of our pre
Results 21  30
of
790,374