3894 search results - page 659 / 779 » Approximation Algorithms for Biclustering Problems |
246
Voted
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
123
Voted
SIROCCO
2010
15 years 4 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
142
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
134
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
123
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...