Sciweavers

3708 search results - page 422 / 742
» The Inverse Classification Problem
Sort
View
SIAMMAX
2010
113views more  SIAMMAX 2010»
15 years 1 months ago
Approximate Nullspace Iterations for KKT Systems
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...
CHI
2009
ACM
16 years 7 months ago
Friend or foe?: examining CAS use in mathematics research
Computer Algebra Systems (CAS) provide sophisticated functionality to assist with mathematical problem solving. Despite their widespread adoption, however, little work in the HCI ...
Andrea Bunt, Michael Terry, Edward Lank
FOCS
2004
IEEE
15 years 10 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor
AAAI
2006
15 years 8 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 1 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...