Sciweavers

2324 search results - page 156 / 465
» A Fast Keyword-Spotting Technique
Sort
View
160
Voted
TCAD
1998
86views more  TCAD 1998»
15 years 6 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
SCFBM
2008
92views more  SCFBM 2008»
15 years 6 months ago
CRANKITE: A fast polypeptide backbone conformation sampler
Background: CRANKITE is a suite of programs for simulating backbone conformations of polypeptides and proteins. The core of the suite is an efficient Metropolis Monte Carlo sample...
Alexei A. Podtelezhnikov, David L. Wild
TMI
2010
123views more  TMI 2010»
15 years 5 months ago
Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren...
ACSAC
2010
IEEE
15 years 4 months ago
Fast and practical instruction-set randomization for commodity systems
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
Georgios Portokalidis, Angelos D. Keromytis
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...