Results 1  10
of
455
rko
"... cues actions between these two types of cues. We measured the apparent modulation depth of a target Gabor at fixation, in the presence ception. The literature from research in psychophysics texture regions (Julesz, 1971; Malik & Perona, 1990; Nothdurft, 1985). The detectability of local elements ..."
Abstract
 Add to MetaCart
in which the perception of aspects of an image is influenced to some extent by the features of other neighboring local elements or by characteristics of the ensemble itself. For example, the local properties of micropatterns are perceptually linked into salient contours according to a specific set of rules
Derandomizing from Random Strings
"... In this paper we show that BPP is truthtable reducible to the set of Kolmogorov random strings RK. It was previously known that PSPACE, and hence BPP is Turingreducible to RK. The earlier proof relied on the adaptivity of the Turingreduction to find a Kolmogorovrandom string of polynomial length ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
In this paper we show that BPP is truthtable reducible to the set of Kolmogorov random strings RK. It was previously known that PSPACE, and hence BPP is Turingreducible to RK. The earlier proof relied on the adaptivity of the Turingreduction to find a Kolmogorovrandom string of polynomial length
Extremal Problems on Set Systems
, 2002
"... For a family F (k) = fF 2 ; : : : ; F t g of kuniform hypergraphs let ex(n; F (k)) denote the maximum number of ktuples which a kuniform hypergraph on n vertices may have, while not containing any member of F (k). Let rk (n) denote the maximum cardinality of a set of integers Z [n], wh ..."
Abstract

Cited by 37 (15 self)
 Add to MetaCart
For a family F (k) = fF 2 ; : : : ; F t g of kuniform hypergraphs let ex(n; F (k)) denote the maximum number of ktuples which a kuniform hypergraph on n vertices may have, while not containing any member of F (k). Let rk (n) denote the maximum cardinality of a set of integers Z [n
(−1)r−k r k
, 2006
"... In this paper we investigate the invariancy of a class of real sequences with respect to the transformation A: a → A(a). 2000 Mathematics Subject Classification: 40G05 1 We consider the set of real sequences K, the set Km of all sequences which are convex of order m (m ∈ N) and the operator ∆r: K → ..."
Abstract
 Add to MetaCart
In this paper we investigate the invariancy of a class of real sequences with respect to the transformation A: a → A(a). 2000 Mathematics Subject Classification: 40G05 1 We consider the set of real sequences K, the set Km of all sequences which are convex of order m (m ∈ N) and the operator ∆r: K
Skein modules of 3manifolds
 Bull. Ac. Pol.: Math
, 1991
"... It is natural to try to place the new polynomial invariants of links in algebraic topology (e.g. to try to interpret them using homology or homotopy groups). However, one can think that these new polynomial invariants are byproducts of a new more delicate algebraic invariant of 3manifolds which mea ..."
Abstract

Cited by 93 (19 self)
 Add to MetaCart
−1 ∈ R we define the kth skein module Sk(M;R)(r0,...,rk−1) as follows: Let L(M) be the set of all ambient isotopy classes of oriented links in M. Let M(L,R) be a free Rmodule generated by L(M) and S L(M)(r0,...,rk−1) the submodule generated by linear skein expressions r0LO+r1L1+...+rk−1Lk−1, where L
CLaRK  an XMLbased System for Corpora Development
 In: Proc. of the Corpus Linguistics 2001 Conference
, 2001
"... Introduction In this paper we describe the architecture and the intended applications of the CLaRK system. The development of the CLaRK system started under the TbingenSofia International Graduate Programme in Computational Linguistics and Represented Knowledge (CLaRK). The main aim behind the desi ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
Introduction In this paper we describe the architecture and the intended applications of the CLaRK system. The development of the CLaRK system started under the TbingenSofia International Graduate Programme in Computational Linguistics and Represented Knowledge (CLaRK). The main aim behind
Emergency Response Sets in Graphs
"... We introduce a kresponse set as a set of vertices where responders can be placed so that given any set of k emergencies, these responders can respond, one per emergency, where each responder covers its own vertex and its neighbors. A weak kresponse set does not have to worry about emergencies at t ..."
Abstract
 Add to MetaCart
at the vertices of the set. We define Rk and rk as the minimum cardinality of such sets. We provide bounds on these parameters and discuss connections with domination invariants. For example, for a graph G of order n and minimum degree at least 2, R2(G) ≤ 2n/3, while r2(G) ≤ n/2 provided G is also connected
Nearoptimal sparse Fourier representations via sampling
 In STOC
, 2002
"... We give an algorithm for nding a Fourier representation R ofBterms for a given discrete signal A of lengthN, such thatkA,Rk 2 2 is within the factor (1 +) of best possible kA,Roptk 2 2. Our algorithm can access A by reading its values on a sample setT [0;N), chosen randomly from a (nonproduct) dist ..."
Abstract

Cited by 95 (24 self)
 Add to MetaCart
We give an algorithm for nding a Fourier representation R ofBterms for a given discrete signal A of lengthN, such thatkA,Rk 2 2 is within the factor (1 +) of best possible kA,Roptk 2 2. Our algorithm can access A by reading its values on a sample setT [0;N), chosen randomly from a (non
Approximating the Radii of Point Sets
, 2005
"... We consider the problem of computing the outerradii of point sets. Inthis problem, we are given integers n, d, k where k < = d, and a set P of n points in Rd. The goal is to compute the outer kradius of P, denoted by Rk(P), which is the minimum, over all (d k)dimensional flats F, ofmax p2P d( ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We consider the problem of computing the outerradii of point sets. Inthis problem, we are given integers n, d, k where k < = d, and a set P of n points in Rd. The goal is to compute the outer kradius of P, denoted by Rk(P), which is the minimum, over all (d k)dimensional flats F, ofmax p2P d
The size of Fulton’s essential set
, 1995
"... The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the essential set in the two cases of arbitrary permutations in Sn and 321avoiding permutations in Sn. Vex ..."
Abstract
 Add to MetaCart
The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the essential set in the two cases of arbitrary permutations in Sn and 321avoiding permutations in Sn
Results 1  10
of
455