485 search results - page 57 / 97 » Iterative Bounding LAO |
139
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
127
Voted
WG
2007
Springer
15 years 11 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
127
Voted
GLOBECOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— In forward error correction, convolutional turbo codes were introduced to increase error correction capability approaching the Shannon bound. Decoding of these codes, however, ...
120
Voted
XIMEP
2005
ACM
15 years 10 months ago
2005
ACM
We report on a compilation procedure that derives relational algebra plans from arbitrarily nested XQuery FLWOR blocks. While recent research was able to develop relational encodi...
177
click to vote
ICDCIT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...