2004 search results - page 169 / 401 » Sampling from large graphs |
119
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
126
Voted
CONTEXT
2007
Springer
15 years 9 months ago
2007
Springer
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
157
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
107
click to vote
PAA
2006
15 years 3 months ago
2006
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...
138
Voted
STTT
2008
15 years 3 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...