Sciweavers

8016 search results - page 1268 / 1604
» On the practical genetic algorithms
Sort
View
ASUNAM
2011
IEEE
14 years 6 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
IACR
2011
136views more  IACR 2011»
14 years 6 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ICA
2012
Springer
14 years 2 months ago
Distributional Convergence of Subspace Estimates in FastICA: A Bootstrap Study
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...
Jarkko Ylipaavalniemi, Nima Reyhani, Ricardo Vig&a...
ICDCIT
2012
Springer
14 years 2 months ago
Decision Making as Optimization in Multi-robot Teams
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
Lynne E. Parker
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 9 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
« Prev « First page 1268 / 1604 Last » Next »