Sciweavers

47 search results - page 3 / 10
» Exact and Approximation Algorithms for DNA Tag Set Design
Sort
View
EVOW
2010
Springer
13 years 6 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
IPSN
2007
Springer
14 years 1 months ago
Exact distributed Voronoi cell computation in sensor networks
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
Boulat A. Bash, Peter Desnoyers
INFORMS
2008
241views more  INFORMS 2008»
13 years 7 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
TWC
2008
117views more  TWC 2008»
13 years 7 months ago
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
Alireza Ghaderipoor, Chintha Tellambura