Sciweavers

4962 search results - page 979 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
AAAI
1990
15 years 26 days ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan
GD
2008
Springer
15 years 23 days ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
BMCBI
2010
139views more  BMCBI 2010»
14 years 11 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
IPL
2006
141views more  IPL 2006»
14 years 11 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
BMCBI
2005
117views more  BMCBI 2005»
14 years 11 months ago
Graph-representation of oxidative folding pathways
Background: The process of oxidative folding combines the formation of native disulfide bond with conformational folding resulting in the native three-dimensional fold. Oxidative ...
Vilmos Ágoston, Masa Cemazar, Lászl&...