Sciweavers

1677 search results - page 99 / 336
» On the Completeness of Quantum Computation Models
Sort
View
BMCBI
2004
208views more  BMCBI 2004»
15 years 1 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
ICAC
2006
IEEE
15 years 7 months ago
Learning Application Models for Utility Resource Planning
Abstract— Shared computing utilities allocate compute, network, and storage resources to competing applications on demand. An awareness of the demands and behaviors of the hosted...
Piyush Shivam, Shivnath Babu, Jeffrey S. Chase
ITCC
2003
IEEE
15 years 6 months ago
A New Quality of Service Metric for Hard/Soft Real-Time Applications
Real-time applications often have mixed hard and soft deadlines, can be preempted subject to the cost of context switching or the restart of computation, and have various data dep...
Shaoxiong Hua, Gang Qu

Book
376views
16 years 11 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
IPPS
1997
IEEE
15 years 5 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...