Sciweavers

1425 search results - page 4 / 285
» Beyond Dependency Graphs
Sort
View
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 2 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
STACS
2010
Springer
14 years 2 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
CVPR
2008
IEEE
14 years 10 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
Vikraman Arvind, Christine T. Cheng, Nikhil R. Dev...
CVPR
2011
IEEE
13 years 3 months ago
Submodularity beyond submodular energies: coupling edges in graph cuts
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
Stefanie Jegelka, Jeff Bilmes