Sciweavers

1722 search results - page 43 / 345
» Variables in Concept Graphs
Sort
View
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
14 years 9 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
DIM
2007
ACM
15 years 1 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 9 months ago
Short Cycles in Random Regular Graphs
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
LAWEB
2004
IEEE
14 years 11 months ago
Integrating Semantic Concept Similarity in Model-Based Web Applications
Model-based design methods, and model-based architectures, have gained adoption in authoring applications for the WWW. This is further reinforced by the increasing visibility of t...
Cristiano Rocha, Daniel Schwabe, Marcus Poggi de A...
ICMCS
2005
IEEE
137views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Co-Clustering of Time-Evolving News Story with Transcript and Keyframe
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
Xiao Wu, Chong-Wah Ngo, Qing Li