Sciweavers

10054 search results - page 1580 / 2011
» On the Complexity of Function Learning
Sort
View
WWW
2007
ACM
16 years 8 months ago
A kernel based structure matching for web services search
This paper describes a kernel based Web Services (abbreviated as service) matching mechanism for service discovery and integration. The matching mechanism tries to exploit the lat...
Yu Jianjun, Guo Shengmin, Su Hao, Zhang Hui, Xu Ke
VLSID
2009
IEEE
115views VLSI» more  VLSID 2009»
16 years 8 months ago
Efficient Techniques for Directed Test Generation Using Incremental Satisfiability
Functional validation is a major bottleneck in the current SOC design methodology. While specification-based validation techniques have proposed several promising ideas, the time ...
Prabhat Mishra, Mingsong Chen
ICIAP
2009
ACM
16 years 8 months ago
A New Generative Feature Set Based on Entropy Distance for Discriminative Classification
Abstract. Score functions induced by generative models extract fixeddimensions feature vectors from different-length data observations by subsuming the process of data generation, ...
Alessandro Perina, Marco Cristani, Umberto Castell...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 8 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
16 years 8 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
« Prev « First page 1580 / 2011 Last » Next »