Sciweavers

8512 search results - page 350 / 1703
» Computing Theory With Relevance
Sort
View
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 1 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 1 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 ...
GBRPR
2009
Springer
16 years 1 months ago
On Computing Canonical Subsets of Graph-Based Behavioral Representations
The collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process....
Walter C. Mankowski, Peter Bogunovich, Ali Shokouf...
197
Voted
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
16 years 1 months ago
Deformations of general parametric shells: Computation and robot experiment
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
Yan-Bin Jia, Jiang Tian