Sciweavers

17760 search results - page 189 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ML
2002
ACM
123views Machine Learning» more  ML 2002»
15 years 4 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein
INFOCOM
2010
IEEE
15 years 2 months ago
Approximate Models for General Cache Networks
Abstract—Many systems employ caches to improve performance. While isolated caches have been studied in-depth, multicache systems are not well understood, especially in networks w...
Elisha J. Rosensweig, James F. Kurose, Donald F. T...
ICALP
2009
Springer
16 years 4 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
IJCAI
1989
15 years 5 months ago
Acquiring Recursive Concepts with Explanation-Based Learning
Explanation-based generalization algorithms need to generalize the structure of their explanations. This is necessary in order to acquire concepts where a recursive or iterative p...
Jude W. Shavlik
SDMW
2009
Springer
15 years 11 months ago
L-Cover: Preserving Diversity by Anonymity
To release micro-data tables containing sensitive data, generalization algorithms are usually required for satisfying given privacy properties, such as k-anonymity and l-diversity....
Lei Zhang 0004, Lingyu Wang, Sushil Jajodia, Alexa...