Sciweavers

3630 search results - page 37 / 726
» Fast Marching Methods
Sort
View
EOR
2007
96views more  EOR 2007»
15 years 6 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
SIAMIS
2011
15 years 1 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
306
Voted
ISQED
2007
IEEE
372views Hardware» more  ISQED 2007»
16 years 20 days ago
From Finance to Flip Flops: A Study of Fast Quasi-Monte Carlo Methods from Computational Finance Applied to Statistical Circuit
Problems in computational finance share many of the characteristics that challenge us in statistical circuit analysis: high dimensionality, profound nonlinearity, stringent accura...
Amith Singhee, Rob A. Rutenbar
VISUALIZATION
2000
IEEE
15 years 10 months ago
Fast visualization methods for comparing dynamics: a case study in combustion
Visualization can be an important tool for displaying, categorizing and digesting large quantities of inter-related information during laboratory and simulation experiments. Summa...
Kay A. Robbins, Michael Gorman
ICCAD
1998
IEEE
75views Hardware» more  ICCAD 1998»
15 years 10 months ago
A fast, accurate, and non-statistical method for fault coverage estimation
We present a fast, dynamic fault coverage estimation technique for sequential circuits that achieves high degrees of accuracy by signi cantly reducing the number of injected fault...
Michael S. Hsiao