Sciweavers

1227 search results - page 49 / 246
» Approximate Kernel Clustering
Sort
View
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
15 years 3 months ago
Approximation Schemes for Broadcasting in Heterogenous Networks
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any...
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
CVPR
2010
IEEE
14 years 7 months ago
Multi-structure model selection via kernel optimisation
Our goal is to fit the multiple instances (or structures) of a generic model existing in data. Here we propose a novel model selection scheme to estimate the number of genuine str...
Tat-Jun Chin, David Suter, Hanzi Wang
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
14 years 9 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
CSDA
2007
128views more  CSDA 2007»
14 years 9 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang