Sciweavers

69 search results - page 7 / 14
» Acceleration Methods for Numeric CSPs
Sort
View
WSC
2007
13 years 9 months ago
Sensitivity estimates from characteristic functions
We investigate the application of the likelihood ratio method (LRM) for sensitivity estimation when the relevant density for the underlying model is known only through its charact...
Paul Glasserman, Zongjian Liu
ICML
1999
IEEE
14 years 8 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
14 years 1 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...
COMPUTING
2006
102views more  COMPUTING 2006»
13 years 7 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
PATMOS
2005
Springer
14 years 28 days ago
Efficient Simulation of Power/Ground Networks with Package and Vias
As the number of metal layers and the frequency of VLSI continue to increase, the voltage droop on both the package and vias is becoming more pronounced. This paper analyzes the nu...
Jin Shi, Yici Cai, Xianlong Hong, Sheldon X.-D. Ta...