Sciweavers

828 search results - page 46 / 166
» Simplicial Powers of Graphs
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
SIMULATION
2008
139views more  SIMULATION 2008»
13 years 8 months ago
Constitutive Hybrid Processes: a Process-Algebraic Semantics for Hybrid Bond Graphs
Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond gra...
Pieter J. L. Cuijpers, Jan F. Broenink, Pieter J. ...
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 8 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 3 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...
CVPR
2008
IEEE
14 years 10 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...