2095 search results - page 242 / 419 » Improved pebbling bounds |
156
click to vote
STACS
2007
Springer
16 years 24 days ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
184
click to vote
ECRTS
2006
IEEE
16 years 22 days ago
2006
IEEE
In this article we provide a model for the dynamic behavior of media processing chains of tasks communicating via bounded buffers. The aim is to find the overall behavior of a cha...
144
Voted
GLOBECOM
2006
IEEE
16 years 22 days ago
2006
IEEE
Abstract— In many scenarios the commonly assumed symmetry in multiple relay channels is unrealistic. Therefore, this paper, through analytical and simulation efforts, investigate...
161
click to vote
HICSS
2006
IEEE
16 years 22 days ago
2006
IEEE
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
163
click to vote
DATE
2005
IEEE
16 years 9 days ago
2005
IEEE
1 The first path implicit and exact non–robust path delay fault grading technique for non–scan sequential circuits is presented. Non enumerative exact coverage is obtained, b...