3894 search results - page 215 / 779 » Approximation Algorithms for Biclustering Problems |
168
click to vote
AAAI
1992
15 years 7 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
298
click to vote
NLP
2000
15 years 10 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
179
click to vote
JSAC
2011
15 years 1 months ago
2011
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...
207
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
162
click to vote
IJSNET
2008
15 years 6 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...