4009 search results - page 135 / 802 » Clustering on Complex Graphs |
110
Voted
EJC
2007
15 years 3 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
134
click to vote
CORR
2010
Springer
15 years 18 days ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
160
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
135
Voted
SAS
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
121
Voted
CHI
2007
ACM
16 years 4 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...