3778 search results - page 302 / 756 » Representing Web Graphs |
145
click to vote
WEBNET
1998
15 years 8 months ago
1998
: This paper gives a short description of a working prototype of an intelligent background knowledge broker as an enhancement module of the Web base training system GENTLE [Maurer ...
150
click to vote
KBS
2007
15 years 6 months ago
2007
In this paper we study the brokering and matchmaking problem, that is, how a requester’s requirements and preferences can be matched against a set of offerings collected by a bro...
207
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper motivates the need for a formalism for the modelling and analysis of dynamic reconfiguration of dependable real-time systems. We present requirements that the formalism ...
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
192
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...