3875 search results - page 610 / 775 » Approximation algorithms for the 0-extension problem |
158
click to vote
SIGGRAPH
1993
ACM
15 years 9 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...
179
click to vote
AAAI
2007
15 years 8 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...
177
click to vote
NIPS
2008
15 years 7 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
132
Voted
AAAI
2006
15 years 7 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 ...
160
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 7 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...