Sciweavers

4809 search results - page 320 / 962
» Scalable Analysis of Scalable Systems
Sort
View
FORMATS
2009
Springer
15 years 11 months ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
DOCENG
2008
ACM
15 years 9 months ago
PrintMonkey: giving users a grip on printing the web
Web content is notoriously difficult to capture on a printed page due to inconsistent and undesired results. Items that users may not want to print, such as media, navigation menu...
Jennifer Baldwin, James A. Rowson, Yvonne Coady
ICDAR
2011
IEEE
14 years 7 months ago
Character n-Gram Spotting in Document Images
—In this paper, we present a novel approach to search and retrieve from document image collections, without explicit recognition. Existing recognition-free approaches such as wor...
M. Sudha Praveen, K. Pramod Sankar, C. V. Jawahar
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 9 months 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...
ECOOP
2009
Springer
16 years 8 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan