463 search results - page 63 / 93 » A General Framework for Graph Sparsification |
129
Voted
ENTCS
2008
15 years 3 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
132
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
154
click to vote
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
144
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
121
click to vote
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
In this paper, we present a novel approach to robust skeleton extraction. We use undirected graphs to model connectivity of the skeleton points. The graph topology remains unchang...