Sciweavers

1998 search results - page 375 / 400
» Basic Association Rules
Sort
View
BMCBI
2008
115views more  BMCBI 2008»
13 years 8 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...
IDT
2008
123views more  IDT 2008»
13 years 8 months ago
A rich semantic model of track as a foundation for sharing beliefs regarding dynamic objects and events
: Many defense, homeland security, and commercial security objectives require continuous tracking of mobile entities such as aircraft. The systems that perform these functions prod...
Frederick Hayes-Roth, Curtis L. Blais
BMCBI
2006
157views more  BMCBI 2006»
13 years 8 months ago
Comparison of protein interaction networks reveals species conservation and divergence
Background: Recent progresses in high-throughput proteomics have provided us with a first chance to characterize protein interaction networks (PINs), but also raised new challenge...
Zhi Liang, Meng Xu, Maikun Teng, Liwen Niu
IANDC
2006
121views more  IANDC 2006»
13 years 8 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin