Sciweavers

4255 search results - page 60 / 851
» Cover
Sort
View
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
14 years 4 months ago
Improvement of the embedding efficiency of LSB matching by sum and difference covering set
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
Xiaolong Li, Tieyong Zeng, Bin Yang
MMSP
2008
IEEE
141views Multimedia» more  MMSP 2008»
14 years 4 months ago
Dynamic chroma feature vectors with applications to cover song identification
A new chroma-based dynamic feature vector is proposed inspired by psychophysical observations that the human auditory system detects relative pitch changes rather than absolute pi...
Samuel Kim, Shrikanth Narayanan
ADHOCNOW
2008
Springer
14 years 4 months ago
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
Andreas Wiese, Evangelos Kranakis
COCO
2007
Springer
107views Algorithms» more  COCO 2007»
14 years 4 months ago
A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
ACNS
2006
Springer
90views Cryptology» more  ACNS 2006»
14 years 4 months ago
Stateful Subset Cover
Abstract. This paper describes a method to convert stateless key revocation schemes based on the subset cover principle into stateful schemes. The main motivation is to reduce the ...
Mattias Johansson, Gunnar Kreitz, Fredrik Lindholm