Sciweavers

13500 search results - page 280 / 2700
» Improved analysis of D
Sort
View
MMSEC
2006
ACM
115views Multimedia» more  MMSEC 2006»
16 years 18 days ago
An improvement to a biometric.based multimedia content protection scheme
A biometric-based method for multimedia content protection was recently proposed. The method relies on biometric data of the user and a layered encryption mechanism to achieve con...
Daniel Socek, Michal Sramka, Oge Marques, Dubravko...
180
Voted
IBPRIA
2005
Springer
16 years 4 days ago
Probabilistic Image-Based Tracking: Improving Particle Filtering
Condensation is a widely-used tracking algorithm based on particle filters. Although some results have been achieved, it has several unpleasant behaviours. In this paper, we highl...
Daniel Rowe, Ignasi Rius, Jordi Gonzàlez, F...
CIKM
2009
Springer
15 years 10 months ago
Building domain-oriented sentiment lexicon by improved information bottleneck
This paper describes an adapted information bottleneck approach for construction of domain-oriented sentiment lexicon. The basic idea is to use three kinds of relationships (WWint...
Weifu Du, Songbo Tan
ANTSW
2008
Springer
15 years 7 months ago
The Architecture of Ant-Based Clustering to Improve Topographic Mapping
Abstract. This paper analyzes the popular ant-based clustering approach of Lumer/Faieta. Analysis of formulae unveils that ant-based clustering is strongly related to Kohonen’s S...
Lutz Herrmann, Alfred Ultsch
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Improved Probabilistic Bounds on Stopping Redundancy
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
Junsheng Han, Paul H. Siegel, Alexander Vardy