Sciweavers

2157 search results - page 149 / 432
» Optimal Fast Hashing
Sort
View
IFIP
1999
Springer
15 years 8 months ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier
CEAS
2007
Springer
15 years 8 months ago
Online Active Learning Methods for Fast Label-Efficient Spam Filtering
Active learning methods seek to reduce the number of labeled examples needed to train an effective classifier, and have natural appeal in spam filtering applications where trustwo...
D. Sculley
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 8 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
137
Voted
ECCV
2010
Springer
15 years 6 months ago
A coarse-to-fine taxonomy of constellations for fast multi-class object detection
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
15 years 6 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne