3875 search results - page 336 / 775 » Approximation algorithms for the 0-extension problem |
207
click to vote
HSNMC
2003
Springer
16 years 1 days ago
2003
Springer
Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session...
186
click to vote
CATS
2006
15 years 8 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
190
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
191
Voted
ALGORITHMICA
2008
15 years 7 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
206
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...