Sciweavers

113 search results - page 22 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 2 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
BIRTHDAY
2011
Springer
12 years 7 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
EDBT
2010
ACM
246views Database» more  EDBT 2010»
14 years 2 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
SEMWEB
2007
Springer
14 years 1 months ago
Vocabulary Patterns in Free-for-all Collaborative Indexing Systems
In collaborative indexing systems users generate a big amount of metadata by labelling web-based content. These labels are known as tags and form a shared vocabulary. In order to u...
Wolfgang Maass, Tobias Kowatsch, Timo Münster