3894 search results - page 465 / 779 » Approximation Algorithms for Biclustering Problems |
142
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
156
click to vote
EMMCVPR
2005
Springer
15 years 10 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
130
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
131
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...
149
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...