7150 search results - page 225 / 1430 » An Approximation Algorithm for Approximation Rank |
175
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
159
click to vote
ECML
2004
Springer
15 years 12 months ago
2004
Springer
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...
179
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
181
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
245
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...