Sciweavers

649 search results - page 40 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
PDCAT
2005
Springer
14 years 2 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
ICPR
2004
IEEE
14 years 10 months ago
Graph Based Image Matching
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
Chong-Wah Ngo, Hui Jiang
WWW
2008
ACM
14 years 9 months ago
Feature weighting in content based recommendation system using social network analysis
We propose a hybridization of collaborative filtering and content based recommendation system. Attributes used for content based recommendations are assigned weights depending on ...
Souvik Debnath, Niloy Ganguly, Pabitra Mitra
OA
1989
237views Algorithms» more  OA 1989»
14 years 27 days ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
ICALP
1995
Springer
14 years 12 days ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis