Sciweavers

41 search results - page 7 / 9
» Distributed Transitive Closure Computations: The Disconnecti...
Sort
View
INFOSCALE
2007
ACM
13 years 9 months ago
BUST: enabling scalable service orchestration
Service-Orientation (SO) is a design and integration paradigm that is based on the notion of well defined, loosely coupled services. Within SO, services are viewed as computation...
Dong Liu, Ralph Deters
HPCA
2007
IEEE
14 years 7 months ago
MemTracker: Efficient and Programmable Support for Memory Access Monitoring and Debugging
Memory bugs are a broad class of bugs that is becoming increasingly common with increasing software complexity, and many of these bugs are also security vulnerabilities. Unfortuna...
Guru Venkataramani, Brandyn Roemer, Yan Solihin, M...
MOBIHOC
2009
ACM
14 years 8 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu
CAV
2009
Springer
135views Hardware» more  CAV 2009»
14 years 8 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang