Sciweavers

5344 search results - page 336 / 1069
» Privacy-Preserving Set Operations
Sort
View
ICIP
2001
IEEE
16 years 6 months ago
Hierarchical watermarking depending on local constraints
In this paper we propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The se...
Christopher D. Coltman, Adrian G. Bors
242
Voted
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 6 months ago
The Haar+ Tree: A Refined Synopsis Data Structure
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
Panagiotis Karras, Nikos Mamoulis
MICCAI
2005
Springer
16 years 5 months ago
Nonrigid Shape Correspondence Using Landmark Sliding, Insertion and Deletion
The growing usage of statistical shape analysis in medical imaging calls for effective methods for highly accurate shape correspondence. This paper presents a novel landmark-based ...
Theodor Richardson, Song Wang
ICML
2006
IEEE
16 years 5 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
ESOP
2010
Springer
16 years 1 months ago
Deadlock-free Channels and Locks
The combination of message passing and locking to protect shared state is a useful concurrency pattern. However, programs that employ this pattern are susceptible to deadlock. That...
Jan Smans, K. Rustan M. Leino, Peter Müller