3894 search results - page 116 / 779 » Approximation Algorithms for Biclustering Problems |
185
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
170
click to vote
IPCCC
2007
IEEE
16 years 21 days ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
204
click to vote
FAW
2010
Springer
15 years 5 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
186
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
185
click to vote
MOC
2002
15 years 6 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...