Sciweavers

1538 search results - page 112 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
STACS
2010
Springer
15 years 8 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
IEEECIT
2010
IEEE
15 years 20 hour ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
INFOCOM
2011
IEEE
14 years 5 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
CVPR
2006
IEEE
16 years 3 months ago
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
Jingyu Yan, Marc Pollefeys
GG
2004
Springer
15 years 7 months ago
Workshop on Graph-Based Tools
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Tom Mens, Andy Schürr, Gabriele Taentzer