Sciweavers

3211 search results - page 381 / 643
» On the Grundy Number of a Graph
Sort
View
ICDCS
2009
IEEE
16 years 3 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
16 years 3 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...
ESSOS
2010
Springer
16 years 3 months ago
Experiences with PDG-Based IFC
Information flow control systems provide the guarantees that are required in today’s security-relevant systems. While the literature has produced a wealth of techniques to ensur...
Christian Hammer
CVPR
2010
IEEE
16 years 2 months ago
Model Evolution: An Incremental Approach to Non-Rigid Structure from Motion
In this paper, we present a new framework for non-rigid structure from motion (NRSFM) that simultaneously addresses three significant challenges: severe occlusion, perspective ca...
Shengqi Zhu, Li Zhang, Brandon Smith
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
16 years 1 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...