Sciweavers

2816 search results - page 249 / 564
» Submodular function minimization
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ISBI
2004
IEEE
16 years 7 months ago
SUMA: An Interface for Surface-Based Intra- and Inter-Subject Analysis with AFNI
Surface-based brain imaging analysis is increasingly being used for detailed analysis of the topology of brain activation patterns and changes in cerebral gray matter. Here we pre...
Brenna Argall, Richard Reynolds, Robert J. Cox, Sh...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 7 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
VLSID
2008
IEEE
120views VLSI» more  VLSID 2008»
16 years 7 months ago
Continuous Frequency Adjustment Technique Based on Dynamic Workload Prediction
Real-time embedded systems increasingly rely on dynamic power management to balance between power and performance goals. In this paper, we present a technique for continuous frequ...
Hwisung Jung, Massoud Pedram
VLDB
2007
ACM
147views Database» more  VLDB 2007»
16 years 6 months ago
A General Framework for Modeling and Processing Optimization Queries
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
Michael Gibas, Ning Zheng, Hakan Ferhatosmanoglu