Sciweavers

2127 search results - page 163 / 426
» Computing large matchings fast
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 7 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
149
Voted
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
15 years 9 months ago
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
Lin Tan, Timothy Sherwood
155
Voted
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 7 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
CVPR
2008
IEEE
16 years 6 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
HPCA
2005
IEEE
16 years 4 months ago
A Small, Fast and Low-Power Register File by Bit-Partitioning
A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ...
Masaaki Kondo, Hiroshi Nakamura