Sciweavers

3394 search results - page 230 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 9 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
EAAI
2008
106views more  EAAI 2008»
13 years 9 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
INFOCOM
2006
IEEE
14 years 3 months ago
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F....
ICIAP
2007
ACM
14 years 9 months ago
Efficient and optimal block matching for motion estimation
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
Stefano Mattoccia, Federico Tombari, Luigi di Stef...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 8 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala