Sciweavers

170 search results - page 6 / 34
» Two Fundamental Issues in Multiprocessing
Sort
View
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
15 years 3 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon
IAJIT
2010
115views more  IAJIT 2010»
14 years 8 months ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 12 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
77
Voted
ATAL
2008
Springer
14 years 11 months ago
Reusing models in multi-agent simulation with software components
on models are abstract representations of systems one wants to study through computer simulation. In multiagent based simulation, such models usually represent agents and their re...
Paulo Salem da Silva, Ana Cristina Vieira de Melo
TKDE
2010
164views more  TKDE 2010»
14 years 7 months ago
PAM: An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects
—Efficiency and privacy are two fundamental issues in moving object monitoring. This paper proposes a privacy-aware monitoring (PAM) framework that addresses both issues. The fra...
Haibo Hu, Jianliang Xu, Dik Lun Lee