Sciweavers

628 search results - page 58 / 126
» Magic Counting Methods
Sort
View
ICPR
2004
IEEE
14 years 9 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
CVPR
2009
IEEE
15 years 3 months ago
Fast concurrent object localization and recognition
Object localization and classification are important problems in computer vision. However, in many applications, exhaustive search over all class labels and image locations is co...
Tom Yeh, John J. Lee, Trevor Darrell
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
14 years 9 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
14 years 5 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
FMCAD
2007
Springer
14 years 2 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton