7015 search results - page 927 / 1403 » Approximation algorithms for co-clustering |
169
click to vote
ECML
2004
Springer
16 years 8 days ago
2004
Springer
Reinforcement learning (RL) algorithms attempt to assign the credit for rewards to the actions that contributed to the reward. Thus far, credit assignment has been done in one of t...
188
click to vote
IMR
2004
Springer
16 years 8 days ago
2004
Springer
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
163
click to vote
ESA
2003
Springer
16 years 3 days ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
176
click to vote
ISAAC
2003
Springer
16 years 2 days ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
153
click to vote
DATE
2002
IEEE
15 years 12 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...