649 search results - page 103 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
168
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
168
click to vote
IJCM
2002
15 years 5 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
184
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
182
click to vote
BMCBI
2011
14 years 9 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
166
Voted
WSDM
2009
ACM
16 years 5 days ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...