2517 search results - page 26 / 504 » Specifying Weak Sets |
119
click to vote
P2P
2006
IEEE
15 years 8 months ago
2006
IEEE
Peers in peer-to-peer file-sharing systems use conjunctive queries as a way of controlling query cost in the absence of information about the behavior of other peers. Conjunctive ...
101
click to vote
EMNLP
2008
15 years 3 months ago
2008
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured...
100
click to vote
JOLLI
2008
15 years 1 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
AML
2008
15 years 2 months ago
2008
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
COMBINATORICS
1998
15 years 1 months ago
1998
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...