3894 search results - page 298 / 779 » Approximation Algorithms for Biclustering Problems |
175
click to vote
TALG
2010
15 years 5 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
201
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
165
click to vote
CJ
2010
15 years 6 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
162
click to vote
CSDA
2006
15 years 6 months ago
2006
: In this paper, we consider the problem of frequency estimation of undamped superimposed exponential signals model. We propose two iterative techniques of frequency estimation usi...
214
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...