3894 search results - page 566 / 779 » Approximation Algorithms for Biclustering Problems |
117
click to vote
DM
2006
15 years 3 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
125
click to vote
JCSS
2008
15 years 3 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
141
click to vote
TON
2008
15 years 3 months ago
2008
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
160
click to vote
TSP
2008
15 years 3 months ago
2008
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
135
click to vote
JWSR
2007
15 years 3 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...