10988 search results - page 344 / 2198 » Algorithmic Folding Complexity |
139
click to vote
JCPHY
2011
14 years 7 months ago
2011
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
142
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
149
click to vote
WSC
2008
15 years 7 months ago
2008
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
165
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
138
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...