Sciweavers

1489 search results - page 2 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
14 years 9 days ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 9 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICPR
2008
IEEE
14 years 2 days ago
Optimal feature weighting for the continuous HMM
We propose new Continuous Hidden Markov Model (CHMM) structure that integrates feature weighting component. We assume that each feature vector could include different subsets of f...
Oualid Missaoui, Hichem Frigui
EMNLP
2008
13 years 7 months ago
Arabic Named Entity Recognition using Optimized Feature Sets
The Named Entity Recognition (NER) task has been garnering significant attention in NLP as it helps improve the performance of many natural language processing applications. In th...
Yassine Benajiba, Mona T. Diab, Paolo Rosso
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
14 years 7 months ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro