Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,598
HITTING TIME OF LARGE SUBSETS OF THE HYPERCUBE
, 2006
"... Abstract. We study the simple random walk on the n-dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly-rescaled hitting time is asymptotically exponentially distributed, uniformly in the starting p ..."
Abstract
- Add to MetaCart
Abstract. We study the simple random walk on the n-dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly-rescaled hitting time is asymptotically exponentially distributed, uniformly in the starting
Automatic Acquisition of Hyponyms from Large Text Corpora
, 1992
"... We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidante of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexico-syntactic patterns that are ..."
Abstract
-
Cited by 1261 (4 self)
- Add to MetaCart
that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also he acquirable iu this way. A subset of the acquisitiou
Monetary Policy Shocks: What Have we Learned and to What End?
, 1998
"... This paper reviews recent research that grapples with the question: What happens after an exogenous shock to monetary policy? We argue that this question is interesting because it lies at the center of a particular approach to assessing the empirical plausibility of structural economic models that c ..."
Abstract
-
Cited by 988 (26 self)
- Add to MetaCart
effects of a monetary policy shock in the sense that inference is robust across a large subset of the identification schemes that have been considered in the literature. We document the nature of this agreement as
The sum-product estimate for large subsets of prime fields
, 2008
"... Let Fp be the field of prime order p. It is known that for any integer N ∈ [1,p] one can construct a subset A ⊂ Fp with |A | = N such that max{|A + A|, |AA|} ≪ p 1/2 |A | 1/2. One of the results of the present paper implies that if A ⊂ Fp with |A |>p2/3, then max{|A + A|, |AA|} ≫ p 1/2 |A | ..."
Abstract
-
Cited by 31 (2 self)
- Add to MetaCart
Let Fp be the field of prime order p. It is known that for any integer N ∈ [1,p] one can construct a subset A ⊂ Fp with |A | = N such that max{|A + A|, |AA|} ≪ p 1/2 |A | 1/2. One of the results of the present paper implies that if A ⊂ Fp with |A |>p2/3, then max{|A + A|, |AA|} ≫ p 1/2 |A
Recognizing Contextual Polarity in Phrase-Level Sentiment Analysis
- In Proceedings of HLT-EMNLP
, 2005
"... This paper presents a new approach to phrase-level sentiment analysis that first determines whether an expression is neutral or polar and then disambiguates the polarity of the polar expressions. With this approach, the system is able to automatically identify the contextual polarity for a large sub ..."
Abstract
-
Cited by 454 (15 self)
- Add to MetaCart
This paper presents a new approach to phrase-level sentiment analysis that first determines whether an expression is neutral or polar and then disambiguates the polarity of the polar expressions. With this approach, the system is able to automatically identify the contextual polarity for a large
Protocols for self-organization of a wireless sensor network
- IEEE Personal Communications
, 2000
"... We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation ..."
Abstract
-
Cited by 536 (5 self)
- Add to MetaCart
We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing
Hierarchically Classifying Documents Using Very Few Words
, 1997
"... The proliferation of topic hierarchies for text documents has resulted in a need for tools that automatically classify new documents within such hierarchies. Existing classification schemes which ignore the hierarchical structure and treat the topics as separate classes are often inadequate in text ..."
Abstract
-
Cited by 521 (8 self)
- Add to MetaCart
classification where the there is a large number of classes and a huge number of relevant features needed to distinguish between them. We propose an approach that utilizes the hierarchical topic structure to decompose the classification task into a set of simpler problems, one at each node in the classification
On the existence of large subsets of [λ] <κ
, 1999
"... which contain no unbounded non-stationary subsets * ..."
Almost Disjoint Large Subsets of Semigroups, Topology Appl
"... Abstract. There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick , central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract. There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick , central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain
Results 1 - 10
of
9,598
