Sciweavers

716 search results - page 127 / 144
» time 1997
Sort
View
RECOMB
1997
Springer
14 years 3 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 3 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
ICCAD
1997
IEEE
137views Hardware» more  ICCAD 1997»
14 years 2 months ago
Optimization techniques for high-performance digital circuits
The relentless push for high performance in custom digital circuits has led to renewed emphasis on circuit optimization or tuning. The parameters of the optimization are typically...
Chandramouli Visweswariah
AAAI
1997
14 years 7 days ago
Case and Constraint-Based Apartment Construction Project Planning System: FASTrak-APT
To effectively generate a fast and consistent apartment construction project network, Hyundai and KAIST have developed a case and constraint based project planning expert system f...
Kyoung Jun Lee, Hyun Woo Kim, Jae Kyu Lee, Tae Hwa...
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
14 years 7 days 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