Sciweavers

90 search results - page 1 / 18
» Structure Sharing Problem And Its Solution In Graph Unificat...
Sort
View
COLING
1994
13 years 6 months ago
Structure Sharing Problem And Its Solution In Graph Unification
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
Kiyoshi Kogure
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
13 years 10 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
CP
2009
Springer
14 years 5 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
AISS
2010
161views more  AISS 2010»
13 years 2 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
CIKM
2010
Springer
12 years 11 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki