Sciweavers

1612 search results - page 4 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICALP
2000
Springer
13 years 11 months ago
A Matrix-based Method for Analysing Stochastic Process Algebras
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
Jeremy T. Bradley, N. J. Davies
CIKM
2008
Springer
13 years 9 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
IJHPCN
2008
94views more  IJHPCN 2008»
13 years 7 months ago
Analysing and improving clustering based sampling for microprocessor simulation
: We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sa...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
SPIN
2010
Springer
13 years 5 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
AUSAI
2007
Springer
13 years 11 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain