Sciweavers

497 search results - page 56 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
NIPS
2004
14 years 11 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy
VISUALIZATION
1997
IEEE
15 years 2 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano
DAC
2005
ACM
14 years 11 months ago
Total power reduction in CMOS circuits via gate sizing and multiple threshold voltages
Minimizing power consumption is one of the most important objectives in IC design. Resizing gates and assigning different Vt’s are common ways to meet power and timing budgets. ...
Feng Gao, John P. Hayes
BMCBI
2008
116views more  BMCBI 2008»
14 years 10 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
Alvaro J. González, Li Liao
ACL
2009
14 years 7 months ago
Automatically Generating Wikipedia Articles: A Structure-Aware Approach
In this paper, we investigate an approach for creating a comprehensive textual overview of a subject composed of information drawn from the Internet. We use the high-level structu...
Christina Sauper, Regina Barzilay