Sciweavers

740 search results - page 25 / 148
» An approximation ratio for biclustering
Sort
View
APPROX
2004
Springer
117views Algorithms» more  APPROX 2004»
15 years 7 months ago
The Greedy Algorithm for the Minimum Common String Partition Problem
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
Marek Chrobak, Petr Kolman, Jiri Sgall
WCNC
2010
IEEE
15 years 5 months ago
Performance of a Cooperative Network Using Rate Adaptation and Cooperative Combining
—The performance of a cooperative network with Cooperative Maximal Ratio Combining (C-MRC) is analyzed. To this end, we propose a heuristic approximation to the total received SN...
Prasanna Kalansuriya, Madushanka Soysa, Chintha Te...
ECML
2006
Springer
15 years 5 months ago
Constant Rate Approximate Maximum Margin Algorithms
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
Petroula Tsampouka, John Shawe-Taylor
CORR
2011
Springer
179views Education» more  CORR 2011»
14 years 5 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
ICIP
2007
IEEE
16 years 3 months ago
Hierarchical Tensor Approximation of Multidimensional Images
Visual data comprises of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop an adaptive data approximation technique based on a hie...
Qing Wu, Tian Xia, Yizhou Yu