19700 search results - page 3581 / 3940 » DNA-Based Computation Times |
143
click to vote
VLDB
1997
ACM
15 years 11 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
213
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
194
click to vote
COMPGEOM
1992
ACM
15 years 11 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
218
Voted
PPSN
1994
Springer
15 years 11 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
194
Voted
SIGGRAPH
1993
ACM
15 years 11 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...