Sciweavers

732 search results - page 17 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
KDD
2010
ACM
242views Data Mining» more  KDD 2010»
13 years 9 months ago
A scalable two-stage approach for a class of dimensionality reduction techniques
Dimensionality reduction plays an important role in many data mining applications involving high-dimensional data. Many existing dimensionality reduction techniques can be formula...
Liang Sun, Betul Ceran, Jieping Ye
ICML
2009
IEEE
14 years 8 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
STACS
2010
Springer
14 years 20 days ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
CKEC
1991
13 years 11 months ago
Case-Based Reasoning and Model-Based Knowledge Acquisition
We propose in this paper a general framework for integrating inductive and case-based reasoning techniques for diagnosis tasks. We present a set of practical integrated approaches...
Dietmar Janetzko, Gerhard Strube
GLVLSI
2003
IEEE
130views VLSI» more  GLVLSI 2003»
14 years 25 days ago
Zero overhead watermarking technique for FPGA designs
FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing w...
Adarsh K. Jain, Lin Yuan, Pushkin R. Pari, Gang Qu