524 search results - page 51 / 105 » Temporal reachability graphs |
DEXA
2010
Springer
13 years 10 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
KES
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we discuss how graph mining system is applied to sales transaction data so as to understand consumer behavior. First, existing research of consumer behavior analysis ...
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
A machine learning technique for handling scenarios of interaction between conflicting agents is suggested. Scenarios are represented by directed graphs with labeled vertices (for ...
FLAIRS
2008
14 years 7 days ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...