Sciweavers

2517 search results - page 26 / 504
» Specifying Weak Sets
Sort
View
P2P
2006
IEEE
118views Communications» more  P2P 2006»
15 years 5 months ago
Conjunction Dysfunction: The Weakness of Conjunctive Queries in Peer-to-Peer File-sharing Systems
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 ...
Wai Gen Yee, Linh Thai Nguyen, Ophir Frieder
EMNLP
2008
15 years 1 months ago
Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
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...
Partha Pratim Talukdar, Joseph Reisinger, Marius P...
JOLLI
2008
84views more  JOLLI 2008»
14 years 11 months ago
The basic constructive logic for a weak sense of consistency
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...
Gemma Robles, José M. Méndez
AML
2008
53views more  AML 2008»
14 years 12 months ago
Pairs, sets and sequences in first-order theories
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...
Albert Visser
COMBINATORICS
1998
91views more  COMBINATORICS 1998»
14 years 11 months ago
New Bounds for Union-free Families of Sets
: 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...
Don Coppersmith, James B. Shearer