Sciweavers

2374 search results - page 141 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
COLT
2000
Springer
15 years 9 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon

Publication
241views
15 years 6 months ago
Fast compositing for cluster-parallel rendering
The image compositing stages in cluster-parallel rendering for gathering and combining partial rendering results into a final display frame are fundamentally limited by node-to-nod...
Maxim Makhinya, Stefan Eilemann, Renato Pajarola
155
Voted
SIAMCO
2002
121views more  SIAMCO 2002»
15 years 4 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak
JAIR
2002
163views more  JAIR 2002»
15 years 4 months ago
Efficient Reinforcement Learning Using Recursive Least-Squares Methods
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...
Xin Xu, Hangen He, Dewen Hu
FUIN
2010
143views more  FUIN 2010»
15 years 1 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer