Sciweavers

495 search results - page 59 / 99
» Data exchange: computing cores in polynomial time
Sort
View
BMCBI
2010
96views more  BMCBI 2010»
13 years 9 months ago
A statistical framework for differential network analysis from microarray data
Background: It has been long well known that genes do not act alone; rather groups of genes act in consort during a biological process. Consequently, the expression levels of gene...
Ryan Gill, Somnath Datta, Susmita Datta
TAMC
2009
Springer
14 years 3 months ago
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
14 years 1 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
SPDP
1993
IEEE
14 years 1 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller
DAC
1995
ACM
14 years 14 days ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram