3894 search results - page 636 / 779 » Approximation Algorithms for Biclustering Problems |
129
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
142
click to vote
VC
2011
14 years 10 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
140
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
158
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
90
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...