Sciweavers

115 search results - page 17 / 23
» Type-Based Optimization for Regular Patterns
Sort
View
CIKM
2011
Springer
12 years 7 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 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
DAC
2002
ACM
14 years 8 months ago
Exploiting shared scratch pad memory space in embedded multiprocessor systems
In this paper, we present a compiler strategy to optimize data accesses in regular array-intensive applications running on embedded multiprocessor environments. Specifically, we p...
Mahmut T. Kandemir, J. Ramanujam, Alok N. Choudhar...
ICML
2007
IEEE
14 years 8 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
ICSM
2007
IEEE
14 years 1 months ago
Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation
Time series analysis is a promising approach to discover temporal patterns from time stamped, numeric data. A novel approach to apply time series analysis to discern temporal info...
Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkra...