Sciweavers

733 search results - page 99 / 147
» Recommending random walks
Sort
View
FGCS
2010
108views more  FGCS 2010»
14 years 8 months ago
The wandering token: Congestion avoidance of a shared resource
In a distributed system where scalability is an issue, like in a GRID [5], the problem of enforcing mutual exclusion often arises in a soft form: the infrequent failure of the mut...
Augusto Ciuffoletti
ICST
2010
IEEE
14 years 8 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
Abderrahmane Feliachi, Hélène Le Gue...
SIGCOMM
2010
ACM
14 years 8 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
EMNLP
2010
14 years 7 months ago
Summarizing Contrastive Viewpoints in Opinionated Text
This paper presents a two-stage approach to summarizing multiple contrastive viewpoints in opinionated text. In the first stage, we use an unsupervised probabilistic approach to m...
Michael Paul, ChengXiang Zhai, Roxana Girju
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 4 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...