Sciweavers

392 search results - page 7 / 79
» Reversal Complexity Revisited
Sort
View
ALGORITHMICA
2002
97views more  ALGORITHMICA 2002»
13 years 7 months ago
Testing and Spot-Checking of Data Streams
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...
ICIP
2007
IEEE
14 years 9 months ago
Efficient Motion Estimation in H.264 Reverse Transcoding
In this paper, we propose a fast reverse motion estimation algorithm with efficient mode decision for reverse transcoding of H.264 bitstream. By analyzing the motion vectors and m...
Chang-Hong Fu, Yui-Lam Chan, Wan-Chi Siu
ICDCN
2010
Springer
13 years 11 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
SYNASC
2006
IEEE
105views Algorithms» more  SYNASC 2006»
14 years 1 months ago
A Meta-Model for Enterprise Applications
In the last years, as object-oriented software systems became more and more complex, the need of performing automatically reverse engineering upon these systems has increased sign...
Cristina Marinescu, Ioan Jurca
IPL
2008
86views more  IPL 2008»
13 years 7 months ago
A more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
Sèverine Bérard, Cedric Chauve, Chri...