Sciweavers

436 search results - page 46 / 88
» On two variations of identifying codes
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
3DPVT
2004
IEEE
159views Visualization» more  3DPVT 2004»
15 years 1 months ago
Blind Watermarking of 3D Shapes using Localized Constraints
This paper develops a digital watermarking methodology for 3-D graphical objects defined by polygonal meshes. In watermarking or fingerprinting the aim is to embed a code in a giv...
Adrian G. Bors
IEE
2008
108views more  IEE 2008»
14 years 10 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke
ICIP
2010
IEEE
14 years 7 months ago
Quantization optimized H.264 encoding for traffic video tracking applications
The compression of video can reduce the accuracy of post-compression tracking algorithms. This is problematic for centralized applications such as traffic surveillance systems, wh...
Eren Soyak, Sotirios A. Tsaftaris, Aggelos K. Kats...
TIT
2010
110views Education» more  TIT 2010»
14 years 4 months ago
On network interference management
We study two building-block models of interference-limited wireless networks, motivated by the problem of joint Peer-to-Peer and Wide Area Network design. In the first case, a sin...
Aleksandar Jovicic, Hua Wang, Pramod Viswanath