Sciweavers

1208 search results - page 221 / 242
» On Counting Generalized Colorings
Sort
View
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 10 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
TOG
2002
96views more  TOG 2002»
13 years 7 months ago
Robust epsilon visibility
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new me...
Florent Duguet, George Drettakis
DAGM
2011
Springer
12 years 7 months ago
Agnostic Domain Adaptation
The supervised learning paradigm assumes in general that both training and test data are sampled from the same distribution. When this assumption is violated, we are in the setting...
Alexander Vezhnevets, Joachim M. Buhmann
WWW
2006
ACM
14 years 8 months ago
Protecting browser state from web privacy attacks
Through a variety of means, including a range of browser cache methods and inspecting the color of a visited hyperlink, client-side browser state can be exploited to track users a...
Collin Jackson, Andrew Bortz, Dan Boneh, John C. M...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 8 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...