5595 search results - page 494 / 1119 » Approximation Algorithms for Clustering Problems |
178
click to vote
ESANN
2007
15 years 9 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...
211
click to vote
COCO
2006
Springer
15 years 11 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
204
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
We propose a novel algorithm for segmenting multiple motions of different types from point correspondences in multiple affine or perspective views. Since point trajectories associ...
239
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
197
click to vote
CISS
2008
IEEE
16 years 2 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...