2157 search results - page 93 / 432 » Binary ant algorithm |
101
Voted
ACTAC
2006
15 years 16 days ago
2006
The problem of the reconstruction of binary matrices from their fan-beam projections is investigated here. A fan-beam projection model is implemented and afterwards employed in sy...
86
Voted
IPL
2007
15 years 11 days ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
131
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
103
click to vote
COMPGEOM
1997
ACM
15 years 4 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
126
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...