Sciweavers

43 search results - page 9 / 9
» Cycles of given length in oriented graphs
Sort
View
COMPGEOM
2004
ACM
15 years 2 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
93
Voted
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
14 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
ECOOP
1997
Springer
15 years 1 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool