Results 1  10
of
1,303
Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm
 Machine Learning
, 1988
"... learning Boolean functions, linearthreshold algorithms Abstract. Valiant (1984) and others have studied the problem of learning various classes of Boolean functions from examples. Here we discuss incremental learning of these functions. We consider a setting in which the learner responds to each ex ..."
Abstract

Cited by 773 (5 self)
 Add to MetaCart
be expressed as a linearthreshold algorithm. A primary advantage of this algorithm is that the number of mistakes grows only logarithmically with the number of irrelevant attributes in the examples. At the same time, the algorithm is computationally efficient in both time and space. 1.
Mercury: Supporting scalable multiattribute range queries
 In SIGCOMM
, 2004
"... This paper presents the design of Mercury, a scalable protocol for supporting multiattribute rangebased searches. Mercury differs from previous rangebased query systems in that it supports multiple attributes as well as performs explicit load balancing. Efficient routing and load balancing are imp ..."
Abstract

Cited by 339 (6 self)
 Add to MetaCart
are implemented using novel lightweight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmichop routing and nearuniform load balancing. We also show that a publishsubscribe system based
logarithmic phase
, 2014
"... A short RNA stem–loop is necessary and sufficient for repression of gene expression during early ..."
Abstract
 Add to MetaCart
A short RNA stem–loop is necessary and sufficient for repression of gene expression during early
Truthful Mechanisms for OneParameter Agents
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract

Cited by 232 (3 self)
 Add to MetaCart
In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s
A Class of Logarithmic Integrals
 Proc. of ISSAC'97
, 1997
"... Abstract. A class of de nite integrals involving cyclotomic polynomials and nested logarithms is considered. The results are given in terms of derivatives of the Hurwitz Zeta function. Some special cases for which such derivatives can be expressed in closed form are also considered. The integration ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Abstract. A class of de nite integrals involving cyclotomic polynomials and nested logarithms is considered. The results are given in terms of derivatives of the Hurwitz Zeta function. Some special cases for which such derivatives can be expressed in closed form are also considered. The integration
Iterated primitives of logarithmic powers
 International Journal of Number Theory
, 2011
"... Abstract. The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these polynomials is established. 1. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these polynomials is established. 1.
GraphLog: a Visual Formalism for Real Life Recursion
 In Proceedings of the Ninth ACM SIGACTSIGMOD Symposium on Principles of Database Systems
, 1990
"... We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language a ..."
Abstract

Cited by 193 (18 self)
 Add to MetaCart
We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language
A LOGARITHMIC HARDY INEQUALITY
, 2010
"... We prove a new inequality which improves on the classical Hardy inequality in the sense that a nonlinear integral quantity with superquadratic growth, which is computed with respect to an inverse square weight, is controlled by the energy. This inequality differs from standard logarithmic Sobolev ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
Sobolev inequalities in the sense that the measure is neither Lebesgue’s measure nor a probability measure. All terms are scale invariant. After an EmdenFowler transformation, the inequality can be rewritten as an optimal inequality of logarithmic Sobolev type on the cylinder. Explicit expressions
MANIFOLD NATURE OF LOGARITHMS: NUMBERS, OPERATIONS AND FUNCTIONS
"... This study addresses the understanding of logarithms and common difficulties students encounter as they study this topic. The study focuses on different tasks: some standard and others nonstandard that involve logarithmic expressions or require the use of logarithms in a solution or explanations. R ..."
Abstract
 Add to MetaCart
This study addresses the understanding of logarithms and common difficulties students encounter as they study this topic. The study focuses on different tasks: some standard and others nonstandard that involve logarithmic expressions or require the use of logarithms in a solution or explanations
Inflationary Models with Logarithmic Potentials
, 1995
"... We examine inflationary universe models driven by scalar fields with logarithmic potentials of the form V (OE) = V 0 OE p (ln OE) q . Combining the slowroll approximation with asymptotic techniques, we identify regions of the potential where inflation may occur and obtain analytic expressions f ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We examine inflationary universe models driven by scalar fields with logarithmic potentials of the form V (OE) = V 0 OE p (ln OE) q . Combining the slowroll approximation with asymptotic techniques, we identify regions of the potential where inflation may occur and obtain analytic expressions
Results 1  10
of
1,303