2342 search results - page 165 / 469 » Sublinear geometric algorithms |
165
Voted
DEXA
2010
Springer
15 years 3 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
118
click to vote
EAAI
2008
15 years 3 months ago
2008
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...
162
Voted
PR
2011
14 years 10 months ago
2011
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
121
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
124
Voted
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...