Sciweavers

4894 search results - page 622 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
BIOINFORMATICS
2007
76views more  BIOINFORMATICS 2007»
15 years 4 months ago
Optimization of primer design for the detection of variable genomic lesions in cancer
Primer approximation multiplex PCR (PAMP) is a new experimental protocol for efficiently assaying structural variation in genomes. PAMP is particularly suited to cancer genomes w...
Ali Bashir, Yu-Tsueng Liu, Benjamin J. Raphael, De...
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 4 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
IJBRA
2008
66views more  IJBRA 2008»
15 years 4 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...
EOR
2006
73views more  EOR 2006»
15 years 4 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...
114
Voted
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik