Results 1  10
of
103,300
Open information extraction from the web
 IN IJCAI
, 2007
"... Traditionally, Information Extraction (IE) has focused on satisfying precise, narrow, prespecified requests from small homogeneous corpora (e.g., extract the location and time of seminars from a set of announcements). Shifting to a new domain requires the user to name the target relations and to ma ..."
Abstract

Cited by 372 (39 self)
 Add to MetaCart
of relational tuples without requiring any human input. The paper also introduces TEXTRUNNER, a fully implemented, highly scalable OIE system where the tuples are assigned a probability and indexed to support efficient extraction and exploration via user queries. We report on experiments over a 9,000,000 Web
Safer Tuple Spaces
, 1997
"... . The simplicity and elegance of the Linda programming model is based on its single, global, typeless tuple space. However, these virtues come at a cost. First, the tuple space can be an impediment to scalable high performance. Second, the "black box" nature of the tuple space makes it an ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. The simplicity and elegance of the Linda programming model is based on its single, global, typeless tuple space. However, these virtues come at a cost. First, the tuple space can be an impediment to scalable high performance. Second, the "black box" nature of the tuple space makes
Reactive Tuple Spaces for Mobile Agent Coordination
, 1998
"... Mobile active computational entities introduce peculiar problems in the coordination of distributed application components. The paper surveys several coordination models for mobile agent applications and outlines the advantages of uncoupled coordination models based on reactive blackboards. On this ..."
Abstract

Cited by 73 (12 self)
 Add to MetaCart
. On this base, the paper presents the design and the implementation of the MARS system, a coordination tool for Javabased mobile agents. MARS defines Lindalike tuple spaces that can be programmed to react with specific actions to the accesses made by mobile agents. Keywords: Mobile Agents, Coordination
THE DEFECT SEQUENCE FOR CONTRACTIVE TUPLES
"... ABSTRACT. We introduce the defect sequence for a contractive tuple of Hilbert space operators and investigate its properties. The defect sequence is a sequence of numbers, called defect dimensions associated with a contractive tuple. We show that there are upper bounds for the defect dimensions. The ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT. We introduce the defect sequence for a contractive tuple of Hilbert space operators and investigate its properties. The defect sequence is a sequence of numbers, called defect dimensions associated with a contractive tuple. We show that there are upper bounds for the defect dimensions
Collective Sorting Tuple Spaces
"... Coordination of multiagent systems is recently moving towards the application of techniques coming from the research context of complex systems: adaptivity and selforganisation are exploited in order to tackle openness, dynamism and unpredictability of typical multiagent systems applications. In thi ..."
Abstract
 Add to MetaCart
. In this paper we focus on a coordination problem called collective sorting, where autonomous agents are assigned the task of moving tuples across different tuple spaces according to local criteria, resulting in the emergence of the complete clustering property. Using a library we developed for the MAUDE term
Learning Influence Probabilities In Social Networks
"... Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users. However, the question of where these proba ..."
Abstract

Cited by 148 (18 self)
 Add to MetaCart
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a social graph with edges labeled with probabilities of influence between users. However, the question of where
Homogeneous tuples of Multiplication operators on
, 2008
"... Abstract: Let B be the Bergman kernel on the domain of n × m contractive complex matrices (m ≥ n ≥ 1). Let W = Wn,m be the associated Wallach set consisting of those λ ≥ 0 for which Bλ/(m+n) is ( non negative definite and hence) the reproducing kernel of a functional Hilbert space H(λ) = H(λ)(Ωn, ..."
Abstract
 Add to MetaCart
(λ)(Ωn,m). For λ ∈ W, we examine the mntuple M (λ) of operators on H(λ) whose components are multiplications by the mn coordinate functions. This tuple is homogeneous with respect to the group action of SU(n,m) on the matrix ball. Utilising this group action we are able to determine the set of all λ ∈ W
Orbits of Matrix Tuples
"... In this paper we outline a procedure which can be seen as an approximation to the well known “hopeless ” problem of classifying mtuples (m ≥ 2) of n×n matrices under simultaneous conjugation by GLn. The method relies on joint work with C. Procesi, on the étale local structure of matrixinvariants a ..."
Abstract
 Add to MetaCart
In this paper we outline a procedure which can be seen as an approximation to the well known “hopeless ” problem of classifying mtuples (m ≥ 2) of n×n matrices under simultaneous conjugation by GLn. The method relies on joint work with C. Procesi, on the étale local structure of matrix
PRIMES IN TUPLES II
, 2007
"... We prove that liminf n→∞ pn+1 − pn √ log pn(log log pn) 2 where pn denotes the n th prime. Since on average pn+1 −pn is asymptotically log pn, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of valu ..."
Abstract
 Add to MetaCart
We prove that liminf n→∞ pn+1 − pn √ log pn(log log pn) 2 where pn denotes the n th prime. Since on average pn+1 −pn is asymptotically log pn, this shows that we can always find pairs of primes much closer together than the average. We actually prove a more general result concerning the set of values taken on by the differences p − p′ between primes which includes the small gap result above.
Results 1  10
of
103,300