Sciweavers

1632 search results - page 194 / 327
» Topological Analysis of Refinement
Sort
View
TKDE
2012
198views Formal Methods» more  TKDE 2012»
13 years 1 months ago
Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
Yiming Zhang, Ling Liu
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
15 years 11 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
POPL
2010
ACM
15 years 8 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
ICSOC
2004
Springer
15 years 4 months ago
Flexible coordination of service interaction patterns
Service-oriented computing is meant to support loose relationships between organisations: Collaboration procedures on the application-level translate to interaction processes via ...
Christian Zirpins, Winfried Lamersdorf, Toby Baier
CAV
2006
Springer
95views Hardware» more  CAV 2006»
15 years 3 months ago
Yasm: A Software Model-Checker for Verification and Refutation
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
Arie Gurfinkel, Ou Wei, Marsha Chechik