Sciweavers

5964 search results - page 292 / 1193
» A theory of speculative computation
Sort
View
DSS
2002
231views more  DSS 2002»
15 years 7 months ago
Computational aspects of the FLBC framework
Recent research has sought to develop formal languages for business communication as more expressive, flexible and powerful alternatives to current electronic data interchange (ED...
Aspassia Daskalopulu, Marek J. Sergot
WWW
2005
ACM
16 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 7 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
16 years 2 months ago
A Framework for Computing the Privacy Scores of Users in Online Social Networks
—A large body of work has been devoted to address corporate-scale privacy concerns related to social networks. The main focus was on how to share social networks owned by organiz...
Kun Liu, Evimaria Terzi
LICS
2009
IEEE
16 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...