Sciweavers

189 search results - page 26 / 38
» SCARAB: scaling reachability computation on large graphs
Sort
View
87
Voted
CIKM
2006
Springer
15 years 1 months ago
The visual funding navigator: analysis of the NSF funding information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
Shixia Liu, Nan Cao, Hao Lv, Hui Su

Publication
295views
13 years 7 months ago
The Age of Analog Networks.
A large class of systems of biological and technological relevance can be described as analog networks, that is, collections of dynamic devices interconnected by links of varying s...
Claudio Mattiussi, Daniel Marbach, Peter Dürr, Da...
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 1 days ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
IEEEPACT
2007
IEEE
15 years 3 months ago
Error Detection Using Dynamic Dataflow Verification
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
Albert Meixner, Daniel J. Sorin