Sciweavers

1154 search results - page 180 / 231
» On the editing distance of graphs
Sort
View
WIRI
2005
IEEE
14 years 2 months ago
Collaborative Filtering by Mining Association Rules from User Access Sequences
Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by followi...
Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching...
DCG
2010
289views more  DCG 2010»
13 years 9 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
COR
2000
129views more  COR 2000»
13 years 8 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
HICSS
2010
IEEE
193views Biometrics» more  HICSS 2010»
14 years 3 months ago
The Topological and Electrical Structure of Power Grids
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
Paul Hines, Seth Blumsack, E. Cotilla Sanchez, C. ...
ECCV
2002
Springer
14 years 10 months ago
Shock-Based Indexing into Large Shape Databases
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
Thomas B. Sebastian, Philip N. Klein, Benjamin B. ...