Sciweavers

1404 search results - page 281 / 281
» Complexity of admissible rules
Sort
View
BMCBI
2010
140views more  BMCBI 2010»
13 years 2 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
ECCC
2010
83views more  ECCC 2010»
13 years 2 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
EOR
2011
140views more  EOR 2011»
12 years 8 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 7 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss