Sciweavers

7648 search results - page 381 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
ASPDAC
2001
ACM
104views Hardware» more  ASPDAC 2001»
15 years 8 months ago
Optimal spacing and capacitance padding for general clock structures
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
PASTE
2010
ACM
15 years 9 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 5 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 4 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
MTA
2007
111views more  MTA 2007»
15 years 4 months ago
Story creation from heterogeneous data sources
There are numerous applications where there is a need to rapidly infer a story about a given subject from a given set of potentially heterogeneous data sources. In this paper, we f...
Marat Fayzullin, V. S. Subrahmanian, Massimiliano ...