Results 1  10
of
546
On the complexity of space bounded interactive proofs
, 2005
"... We prove two results on interactive proof systems with 2way probabilistic finite state verifiers. The first is a lower bound on the power of such proof systems, if they are not required to halt with high probability on rejected inputs: we show that they can accept any recursively enumerable languag ..."
Abstract

Cited by 78 (5 self)
 Add to MetaCart
language. The second is an upper bound on the power of interactive proof systems that halt with high probability on all inputs: any language they accept is in ATIME(22 O(n)). Our results generalize to other space bounds. The proof techniques we develop have other interesting applications. The proof method
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
longstanding relationships with (Corwin and Schultz (2005)). In the same spirit, networks feature prominently in the venture capital industry. VCs tend to syndicate their investments with other VCs, rather than investing alone (Lerner (1994a)). They are thus bound by their current and past investments
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
as the project is nished. Major corporations work in a strategy of changing alliances and partnerships, speci c to a given product, process, time, and space. Furthermore, these cooperations are based increasingly on sharing of information. These are information networks, which, in the limit, link up suppliers
Threedimensional relationships between hippocampal synapses and astrocytes
 J Neurosci
, 1999
"... Recent studies show that glutamate transportermediated currents occur in astrocytes when glutamate is released from hippocampal synapses. These transporters remove excess glutamate from the extracellular space, thereby facilitating synaptic input specificity and preventing neurotoxicity. Little is ..."
Abstract

Cited by 95 (1 self)
 Add to MetaCart
Recent studies show that glutamate transportermediated currents occur in astrocytes when glutamate is released from hippocampal synapses. These transporters remove excess glutamate from the extracellular space, thereby facilitating synaptic input specificity and preventing neurotoxicity. Little
Learning polynomials with queries: The highly noisy case
, 1995
"... Given a function f mapping nvariate inputs from a finite Kearns et. al. [21] (see also [27, 28, 22]). In the setting of agfieldFintoF, we consider the task of reconstructing a list nostic learning, the learner is to make no assumptions regarding of allnvariate degreedpolynomials which agree withf ..."
Abstract

Cited by 97 (17 self)
 Add to MetaCart
Given a function f mapping nvariate inputs from a finite Kearns et. al. [21] (see also [27, 28, 22]). In the setting of agfieldFintoF, we consider the task of reconstructing a list nostic learning, the learner is to make no assumptions regarding of allnvariate degreedpolynomials which agree
Image decompositions using bounded variation and generalized homogeneous Besov spaces
, 2007
"... This paper is devoted to the decomposition of an image f into u + v, with u a piecewisesmooth or “cartoon” component, and v an oscillatory component (texture or noise), in a variational approach. Y. Meyer [Y. Meyer, Oscillating Patterns in Image Processing and Nonlinear Evolution Equations, Univers ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
, University Lecture Series, vol. 22, Amer. Math. Soc., Providence, RI, 2001] proposed refinements of the total variation model [L. Rudin, S. Osher, E. Fatemi, Nonlinear total variation based noise removal algorithms, Phys. D 60 (1992) 259–268] that better represent the oscillatory part v: the weaker spaces
Practical EntropyBounded Schemes for O(1)Range Minimum Queries
"... Abstract. The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent online queries asking for the position of a minimal element between two specified indices can be obtained in constant time. Several solutions to this problem have been proposed, ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
, starting with Berkman and Vishkin’s linearspace solution [6], and leading to a succinct solution using only 2n+o(n) bits in addition to the input array [12]. The theoretical contribution of this article is to push this latter approach one step further and show that for compressible input arrays the RMQ
EntropyBounded Schemes for O(1)Range Minimum Queries
"... Abstract. The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent online queries asking for the position of a minimal element between two specified indices can be obtained in constant time. Several solutions to this problem have been proposed, ..."
Abstract
 Add to MetaCart
4n + o(n)bit solution [22], and our own 2n + o(n)bit solution. The results of this practical evaluation are (1) the practical space consumptions of the noncompressed schemes scale surprisingly well with their theoretical guarantees, and (2) for compressible input arrays our new compressed schemes
1The Cramér–Rao Bound for Sparse Estimation
"... The goal of this paper is to characterize the best achievable performance for the problem of estimating an unknown parameter having a sparse representation. Specifically, we consider the setting in which a sparsely representable deterministic parameter vector is to be estimated from measurements cor ..."
Abstract
 Add to MetaCart
corrupted by Gaussian noise, and derive a lower bound on the meansquared error (MSE) achievable in this setting. To this end, an appropriate definition of bias in the sparse setting is developed, and the constrained Cramér–Rao bound (CRB) is obtained. This bound is shown to equal the CRB of an estimator
Solving Factored MDPs with Continuous and Discrete Variables
 IN PROCEEDINGS OF THE 20TH CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE
, 2004
"... Although many realworld stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current stateoftheart methods cannot adequately address these problems. We present the first framework that can exploit problem structure for modeling ..."
Abstract

Cited by 37 (8 self)
 Add to MetaCart
that avoids the exponential blowup of traditional approaches. We provide theoretical bounds on the quality of such an approximation and on its scaleup potential. We support our theoretical arguments with experiments on a set of control problems with up to 28dimensional continuous state space and 22
Results 1  10
of
546