Sciweavers

1333 search results - page 169 / 267
» Not a Number of Floating Point Problems
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 4 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
TCBB
2008
126views more  TCBB 2008»
15 years 4 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 3 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
RC
2002
72views more  RC 2002»
15 years 3 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
15 years 2 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang