Sciweavers

7378 search results - page 1080 / 1476
» Introduction to Machine Learning
Sort
View
COMBINATORICA
2010
15 years 1 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
ML
2010
ACM
138views Machine Learning» more  ML 2010»
15 years 1 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
MLDM
2010
Springer
15 years 1 months ago
The Impact of Experimental Setup in Prepaid Churn Prediction for Mobile Telecommunications: What to Predict, for Whom and Does t
Prepaid customers in mobile telecommunications are not bound by a contract and can therefore change operators (`churn') at their convenience and without notification. This mak...
Dejan Radosavljevik, Peter van der Putten, Kim Kyl...
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 10 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
IUI
2012
ACM
14 years 2 months ago
Towards recognizing "cool": can end users help computer vision recognize subjective attributes of objects in images?
Recent computer vision approaches are aimed at richer image interpretations that extend the standard recognition of objects in images (e.g., cars) to also recognize object attribu...
William Curran, Travis Moore, Todd Kulesza, Weng-K...
« Prev « First page 1080 / 1476 Last » Next »