7015 search results - page 104 / 1403 » Approximation algorithms for co-clustering |
DSD
2005
IEEE
14 years 2 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
ADHOC
2010
13 years 9 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
DAM
2008
13 years 9 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...