Sciweavers

610 search results - page 47 / 122
» Fast Modular Reduction
Sort
View
90
Voted
LREC
2008
75views Education» more  LREC 2008»
15 years 2 months ago
Experimental Fast-Tracking of Morphological Analysers for Nguni Languages
The development of natural language processing (NLP) components is resource-intensive and therefore justifies exploring ways of reducing development time and effort when building ...
Sonja E. Bosch, Laurette Pretorius, Kholisa Podile...
93
Voted
BMCBI
2007
151views more  BMCBI 2007»
15 years 26 days ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
120
Voted
SIAMMAX
2010
189views more  SIAMMAX 2010»
14 years 7 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
94
Voted
ISQED
2006
IEEE
90views Hardware» more  ISQED 2006»
15 years 6 months ago
Monte Carlo-Alternative Probabilistic Simulations for Analog Systems
Probabilistic system simulations for analog circuits have traditionally been handled with Monte Carlo analysis. For a manufacturable design, fast and accurate simulations are nece...
Rasit Onur Topaloglu
105
Voted
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
15 years 6 months ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein