5595 search results - page 864 / 1119 » Approximation Algorithms for Clustering Problems |
193
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
169
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
198
click to vote
AAAI
2007
15 years 9 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
150
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
173
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 8 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...