5595 search results - page 685 / 1119 » Approximation Algorithms for Clustering Problems |
169
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
167
click to vote
UAI
2004
15 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
167
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
171
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
166
click to vote
SIGECOM
2005
ACM
16 years 13 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...