628 search results - page 95 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
143
click to vote
IJCNN
2000
IEEE
15 years 7 months ago
2000
IEEE
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
239
Voted
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
142
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
123
Voted
OPODIS
2004
15 years 4 months ago
2004
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
138
Voted
INFOCOM
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...