Sciweavers

2597 search results - page 330 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
15 years 6 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 6 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
15 years 6 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
BMCBI
2008
151views more  BMCBI 2008»
15 years 6 months ago
Application of the Linux cluster for exhaustive window haplotype analysis using the FBAT and Unphased programs
Background: Genetic association studies have been used to map disease-causing genes. A newly introduced statistical method, called exhaustive haplotype association study, analyzes...
Hiroyuki Mishima, Andrew C. Lidral, Jun Ni
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Human Speed-Accuracy Tradeoffs in Search
When foraging for information, users face a tradeoff between the accuracy and value of the acquired information and the time spent collecting it, a problem which also surfaces whe...
Christina Aperjis, Bernardo A. Huberman, Fang Wu