Sciweavers

740 search results - page 1 / 148
» An approximation ratio for biclustering
Sort
View
IPL
2008
78views more  IPL 2008»
13 years 4 months ago
An approximation ratio for biclustering
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
Kai Puolamäki, Sami Hanhijärvi, Gemma C....
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
13 years 4 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
11 years 7 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
PPSN
2010
Springer
13 years 3 months ago
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
Karl Bringmann, Tobias Friedrich
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 5 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar