Sciweavers

77 search results - page 9 / 16
» Exploring adjacency in floorplanning
Sort
View
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
14 years 4 months ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
ACSAC
2003
IEEE
14 years 4 months ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
Kulesh Shanmugasundaram, Nasir D. Memon
CSC
2008
14 years 10 days ago
Eigenvalue Spectra Measurements of Complex Networks
Complex network models such as Kauffman's NK model have been shown to have interesting phase transitional properties as the connectivity is varied. Conventional network and g...
Kenneth A. Hawick
CORR
2002
Springer
82views Education» more  CORR 2002»
13 years 10 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
12 years 1 months ago
Lane decoupling for improving the timing-error resiliency of wide-SIMD architectures
A significant portion of the energy dissipated in modern integrated circuits is consumed by the overhead associated with timing guardbands that ensure reliable execution. Timing ...
Evgeni Krimer, Patrick Chiang, Mattan Erez