Sciweavers

64 search results - page 9 / 13
» Exact Elimination of Cycles in Graphs
Sort
View
PAMI
2002
184views more  PAMI 2002»
14 years 11 months ago
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
JCT
2006
110views more  JCT 2006»
14 years 11 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 11 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
NJC
2006
88views more  NJC 2006»
14 years 11 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
14 years 11 months ago
Which Chessboards have a Closed Knight's Tour within the Cube?
A closed knight’s tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. When the chessboard is translated i...
Joe DeMaio