545 search results - page 49 / 109 » Simultaneous approximation by greedy algorithms |
135
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
135
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
128
click to vote
CIKM
1997
Springer
15 years 8 months ago
1997
Springer
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
129
click to vote
SPLC
2008
15 years 5 months ago
2008
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
146
click to vote
NIPS
1998
15 years 5 months ago
1998
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...