Sciweavers

1550 search results - page 252 / 310
» Benchmarking for Graph Transformation
Sort
View
EUROPAR
2007
Springer
14 years 1 months ago
Efficient Parallel Simulation of Large-Scale Neuronal Networks on Clusters of Multiprocessor Computers
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
Hans E. Plesser, Jochen M. Eppler, Abigail Morriso...
AAAI
2007
14 years 8 days ago
Best-First AND/OR Search for Graphical Models
The paper presents and evaluates the power of best-first search over AND/OR search spaces in graphical models. The main virtue of the AND/OR representation is its sensitivity to ...
Radu Marinescu 0002, Rina Dechter
ASPDAC
2005
ACM
78views Hardware» more  ASPDAC 2005»
13 years 12 months ago
Timing driven track routing considering coupling capacitance
Abstract— As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven ro...
Di Wu, Jiang Hu, Min Zhao, Rabi N. Mahapatra
AC
2008
Springer
13 years 10 months ago
Distributed Sparse Matrices for Very High Level Languages
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...
John R. Gilbert, Steve Reinhardt, Viral Shah
BMCBI
2007
115views more  BMCBI 2007»
13 years 10 months ago
How accurate and statistically robust are catalytic site predictions based on closeness centrality?
Background: We examine the accuracy of enzyme catalytic residue predictions from a network representation of protein structure. In this model, amino acid α-carbons specify vertic...
Eric Chea, Dennis R. Livesay