3894 search results - page 470 / 779 » Approximation Algorithms for Biclustering Problems |
131
click to vote
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
145
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
118
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
155
Voted
WINE
2007
Springer
15 years 10 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
118
click to vote
AIPS
2003
15 years 5 months ago
2003
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...