3894 search results - page 179 / 779 » Approximation Algorithms for Biclustering Problems |
255
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
204
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
161
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
213
click to vote
ACST
2006
15 years 8 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
249
click to vote
ICDCIT
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...