628 search results - page 102 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
126
Voted
SSPR
2004
Springer
15 years 8 months ago
2004
Springer
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
112
Voted
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
116
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
121
click to vote
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
125
click to vote
JMLR
2006
15 years 2 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...