Sciweavers

489 search results - page 46 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
RECOMB
2010
Springer
14 years 3 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
STACS
2005
Springer
14 years 2 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 10 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
DAWAK
2001
Springer
14 years 1 months ago
Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments
Multi-Dimensional Expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX q...
Panos Kalnis, Dimitris Papadias
MP
2006
137views more  MP 2006»
13 years 8 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher