740 search results - page 34 / 148 » An approximation ratio for biclustering |
150
click to vote
JDA
2007
15 years 6 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
191
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
135
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
—The paper describes the transfer functions with monotonic step response. These functions required in design of wide-band pulse amplifiers were synthesized using the first semi-p...
149
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
168
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...