10988 search results - page 360 / 2198 » Algorithmic Folding Complexity |
122
click to vote
WSCG
2001
15 years 6 months ago
2001
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
159
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
141
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
143
click to vote
SIGIR
2008
ACM
15 years 4 months ago
2008
ACM
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
118
click to vote
SWAT
1998
Springer
15 years 9 months ago
1998
Springer
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...