Sciweavers

6202 search results - page 27 / 1241
» Without Loss of Generality
Sort
View
CVPR
2012
IEEE
13 years 10 days ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
ISBI
2006
IEEE
15 years 10 months ago
Assessing the accuracy of non-rigid registration with and without ground truth
We compare two methods for assessing the performance of groupwise non-rigid registration algorithms. One approach, which has been described previously, utilizes a measure of overl...
Roy Schestowitz, Carole J. Twining, Timothy F. Coo...
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
15 years 2 months ago
Self-tuning Histograms: Building Histograms Without Looking at Data
In this paper, we introduce self-tuning histograms. Although similar in structure to traditional histograms, these histograms infer data distributions not by examining the data or...
Ashraf Aboulnaga, Surajit Chaudhuri
NIPS
2008
14 years 11 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang
IPM
2008
100views more  IPM 2008»
14 years 10 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...