Sciweavers

4674 search results - page 802 / 935
» cases 2008
Sort
View
BMCBI
2008
115views more  BMCBI 2008»
15 years 6 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
TROB
2010
58views more  TROB 2010»
15 years 4 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
16 years 7 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 6 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
16 years 3 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...