8728 search results - page 115 / 1746 » On Reduct Construction Algorithms |
120
Voted
ISSAC
1992
Springer
15 years 4 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
IJCNLP
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
106
Voted
ISAAC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
95
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
80
Voted
WADS
1993
Springer
15 years 4 months ago
1993
Springer
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...