1810 search results - page 124 / 362 » Similarity estimation techniques from rounding algorithms |
VISSYM
2003
13 years 9 months ago
2003
Volumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several ...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, a new algorithm for robust adaptive beamforming is developed. The basic idea of the proposed algorithm is to estimate the difference between the actual and presumed...
PERCOM
2007
ACM
14 years 7 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
CEC
2007
IEEE
13 years 10 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...