Sciweavers

156 search results - page 1 / 32
» Edge ranking of weighted trees
Sort
View
DAM
2006
79views more  DAM 2006»
13 years 5 months ago
Edge ranking of weighted trees
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
Dariusz Dereniowski
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 5 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
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...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
ICPR
2002
IEEE
13 years 10 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao
IKE
2003
13 years 6 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
IPL
2006
87views more  IPL 2006»
13 years 5 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski