Sciweavers

237 search results - page 23 / 48
» Practical and Optimal String Matching
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 8 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
VMV
2000
146views Visualization» more  VMV 2000»
13 years 8 months ago
Matching 3D Freeform Shapes to Digitized Objects
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
Joris S. M. Vergeest, Sander Spanjaard, Jos J. O. ...

Book
695views
15 years 2 months ago
The Scheme Programming Language
"Scheme is a general-purpose computer programming language. It is a high-level language, supporting operations on structured data such as strings, lists, and vectors, as well ...
R. Kent Dybvig
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
13 years 10 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter
MASCOTS
2007
13 years 8 months ago
Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
Yu Dong, Wing-Kai Hon, David K. Y. Yau, Jren-Chit ...