2489 search results - page 119 / 498 » On the Subgroup Distance Problem |
144
click to vote
IJISEC
2008
15 years 4 months ago
2008
We study the multicast stream authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. In such a model, packet overhead...
130
click to vote
TJS
2002
15 years 3 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
198
click to vote
PROCEDIA
2011
14 years 6 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
113
click to vote
BIBE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
127
click to vote
EVOW
2007
Springer
15 years 10 months ago
2007
Springer
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...