13603 search results - page 280 / 2721 » On the Complexity of Computing Treelength |
167
click to vote
ACMSE
2006
ACM
16 years 1 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
140
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
211
click to vote
IWCM
2004
Springer
15 years 11 months ago
2004
Springer
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
177
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
146
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...