Sciweavers

686 search results - page 111 / 138
» Packing Cycles in Graphs
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
COCOON
2007
Springer
15 years 3 months ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
83
Voted
ECOOP
2005
Springer
15 years 3 months ago
Static Deadlock Detection for Java Libraries
Library writers wish to provide a guarantee not only that each procedure in the library performs correctly in isolation, but also that the procedures perform correctly when run in ...
Amy Williams, William Thies, Michael D. Ernst
JCP
2008
87views more  JCP 2008»
14 years 9 months ago
VLSI Architecture of a Cellular Automata based One-Way Function
In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellu...
Debdeep Mukhopadhyay, Pallavi Joshi, Dipanwita Roy...
75
Voted
ARSCOM
1998
104views more  ARSCOM 1998»
14 years 9 months ago
A Note on the Road-Coloring Conjecture
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
E. Gocka, Walter W. Kirchherr, Edward F. Schmeiche...