650 search results - page 25 / 130 » Positive graphs |
VLC
2008
14 years 9 months ago
2008
We present the new notion of enforced generative pattern, a structure that declares positive or negative conditions that must be satisfied by a model. Patterns are applied to tran...
76
Voted
JGT
2007
14 years 9 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
MLDM
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
CCCG
2009
14 years 10 months ago
2009
When a graph is drawn in a classical manner, its vertices are shown as small disks and its edges with a positive width; zero-width edges exist only in theory. Let r denote the rad...
108
Voted
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...