Sciweavers

372 search results - page 22 / 75
» On Finding Small 2-Generating Sets
Sort
View
SMA
2005
ACM
119views Solid Modeling» more  SMA 2005»
15 years 5 months ago
Tightening: curvature-limiting morphological simplification
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
Jason Williams, Jarek Rossignac
DAC
1994
ACM
15 years 3 months ago
Permissible Observability Relations in FSM Networks
Previous attempts to capture the phenomenon of output don't care sequencesfor a componentin an FSM network have been incomplete. We demonstrate that output don't care se...
Huey-Yih Wang, Robert K. Brayton
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 5 days ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
BMCBI
2004
154views more  BMCBI 2004»
14 years 11 months ago
Base-By-Base: Single nucleotide-level analysis of whole viral genome alignments
Background: With ever increasing numbers of closely related virus genomes being sequenced, it has become desirable to be able to compare two genomes at a level more detailed than ...
Ryan Brodie, Alex J. Smith, Rachel L. Roper, Vasil...
ICIP
2003
IEEE
16 years 1 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or