Sciweavers

62 search results - page 8 / 13
» Efficient Spectral Feature Selection with Minimum Redundancy
Sort
View
ICCPOL
2009
Springer
14 years 7 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
TASLP
2011
14 years 4 months ago
Time-Frequency Cepstral Features and Heteroscedastic Linear Discriminant Analysis for Language Recognition
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
Weiqiang Zhang, Liang He, Yan Deng, Jia Liu, M. T....
ICML
2005
IEEE
15 years 10 months ago
An efficient method for simplifying support vector machines
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
DucDung Nguyen, Tu Bao Ho
87
Voted
FPL
1997
Springer
242views Hardware» more  FPL 1997»
15 years 1 months ago
Technology mapping by binate covering
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
Michal Servít, Kang Yi