Sciweavers

156 search results - page 18 / 32
» Edge ranking of weighted trees
Sort
View
DAGM
2003
Springer
15 years 5 months ago
Hierarchy of Partitions with Dual Graph Contraction
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
Yll Haxhimusa, Walter G. Kropatsch
MLG
2007
Springer
15 years 6 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...
SIGIR
2008
ACM
14 years 11 months ago
Re-ranking search results using document-passage graphs
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
Michael Bendersky, Oren Kurland
COR
2008
142views more  COR 2008»
14 years 11 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 1 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky