Sciweavers

1816 search results - page 91 / 364
» Trace oblivious computation
Sort
View

Publication
173views
15 years 9 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
R. Jain
CCCG
2010
14 years 6 days ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...
DAC
2009
ACM
14 years 11 months ago
Efficient program scheduling for heterogeneous multi-core processors
Heterogeneous multicore processors promise high execution efficiency under diverse workloads, and program scheduling is critical in exploiting this efficiency. This paper present...
Jian Chen, Lizy Kurian John
LAWEB
2007
IEEE
14 years 5 months ago
Designing the Interface of Rich Internet Applications
In this paper we present a novel approach for designing the interface of rich internet applications. Our approach uses ract Data Views (ADV) design model allowing expressing in a ...
Matias Urbieta, Gustavo Rossi, Jeronimo Ginzburg, ...
ICMCS
2006
IEEE
121views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Real-time video watermarking based on extended m-sequences
This paper presents an oblivious real-time video watermarking scheme in which extended m-sequences is selected as watermark pattern. The good balance property of extended m-sequen...
Fuhao Zou, Zhengding Lu, Hefei Ling, Yanwei Yu