Sciweavers

9736 search results - page 51 / 1948
» How Fast Can We Compute Products
Sort
View
BMCBI
2010
155views more  BMCBI 2010»
15 years 1 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...
130
Voted
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
FAST
2010
15 years 6 months ago
Understanding Latent Sector Errors and How to Protect Against Them
Latent sector errors (LSEs) refer to the situation where particular sectors on a drive become inaccessible. LSEs are a critical factor in data reliability, since a single LSE can ...
Bianca Schroeder, Sotirios Damouras, Phillipa Gill
ICDCS
2006
IEEE
15 years 10 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
WPES
2005
ACM
15 years 10 months ago
Privacy for RFID through trusted computing
Radio Frequency Identification (RFID) technology raises significant privacy issues because it enables tracking of items and people possibly without their knowledge or consent. O...
David Molnar, Andrea Soppera, David Wagner