Sciweavers

791 search results - page 150 / 159
» Nonstationary Function Optimization using the Structured Gen...
Sort
View
114
Voted
PR
2008
169views more  PR 2008»
14 years 11 months ago
A survey of kernel and spectral methods for clustering
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
Maurizio Filippone, Francesco Camastra, Francesco ...
ICML
2007
IEEE
16 years 13 days ago
Learning a meta-level prior for feature relevance from multiple related tasks
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
Su-In Lee, Vassil Chatalbashev, David Vickrey, Dap...
CVPR
2010
IEEE
1639views Computer Vision» more  CVPR 2010»
15 years 7 months ago
Multi-Target Tracking of Time-varying Spatial Patterns
Time-varying spatial patterns are common, but few computational tools exist for discovering and tracking multiple, sometimes overlapping, spatial structures of targets. We propose...
Jingchen Liu, Yanxi Liu
CIKM
2011
Springer
13 years 11 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
123
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 6 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...