Sciweavers

3475 search results - page 251 / 695
» Backbones in Optimization and Approximation
Sort
View
JMLR
2012
13 years 9 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
SIGMOD
2006
ACM
137views Database» more  SIGMOD 2006»
16 years 6 months ago
Optimal multi-scale patterns in time series streams
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
Spiros Papadimitriou, Philip S. Yu
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 6 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis

Publication
210views
16 years 1 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
16 years 1 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario