463 search results - page 42 / 93 » A General Framework for Graph Sparsification |
145
Voted
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
139
Voted
PAMI
2006
15 years 3 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
137
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
171
Voted
SDM
2012
SIAM
13 years 6 months ago
2012
SIAM
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
147
Voted
PLDI
2012
ACM
13 years 6 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...