189 search results - page 4 / 38 » Polynomial-time Computation via Local Inference Relations |
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
89
Voted
ACL
2011
14 years 3 months ago
2011
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
BMCBI
2007
14 years 11 months ago
2007
Background: We performed an exhaustive search for local structural similarities in an ensemble of non-redundant protein functional sites. With the purpose of finding new examples ...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...