Sciweavers

485 search results - page 54 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
13 years 12 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
VLSID
2005
IEEE
102views VLSI» more  VLSID 2005»
14 years 8 months ago
Integrated On-Chip Storage Evaluation in ASIP Synthesis
An Application Specific Instruction Set Processor (ASIP) exploits special characteristics of the given application(s) to meet the desired performance, cost and power requirements....
Manoj Kumar Jain, M. Balakrishnan, Anshul Kumar
DAWAK
2001
Springer
14 years 3 days ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
CONCURRENCY
2004
93views more  CONCURRENCY 2004»
13 years 7 months ago
Studying protein folding on the Grid: experiences using CHARMM on NPACI resources under Legion
-- One of the benefits of a computational grid is the ability to run high-performance applications over distributed resources simply and securely. We demonstrated this benefit with...
Anand Natrajan, Michael Crowley, Nancy Wilkins-Die...
CSB
2005
IEEE
166views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Automated Validation of Polymerase Chain Reactions Using Amplicon Melting Curves
PCR, the polymerase chain reaction, is a fundamental tool of molecular biology. Quantitative PCR is the goldstandard methodology for determination of DNA copy numbers, quantitatin...
Tobias P. Mann, Richard Humbert, John A. Stamatoya...