Sciweavers

6740 search results - page 258 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
122
Voted
EJC
2008
15 years 26 days ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
170
Voted
PAMI
2011
14 years 7 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
101
Voted
NETCOOP
2007
Springer
15 years 7 months ago
Tracing an Optical Buffer's Performance: An Effective Approach
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
Wouter Rogiest, Dieter Fiems, Koenraad Laevens, He...
121
Voted
STACS
2007
Springer
15 years 7 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
108
Voted
ICCAD
1997
IEEE
125views Hardware» more  ICCAD 1997»
15 years 5 months ago
A deductive technique for diagnosis of bridging faults
A deductive technique is presented that uses voltage testing for the diagnosis of single bridging faults between two gate input or output lines and is applicable to combinational ...
Srikanth Venkataraman, W. Kent Fuchs