Sciweavers

680 search results - page 27 / 136
» A randomized embedding algorithm for trees
Sort
View
ICIP
2002
IEEE
14 years 10 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
IPCV
2007
13 years 10 months ago
Quantization Based Blind Watermarking Algorithm Using DWT
- In this paper a Discrete Wavelet Transform based blind watermarking algorithm is proposed for embedding a grayscale watermark into a grayscale image. A new approach of choosing t...
Shikha Tripathi, Sai Krishnan Ramachandran, Vijay ...
SSDBM
1990
IEEE
94views Database» more  SSDBM 1990»
14 years 1 months ago
Random Sampling from Database Files: A Survey
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
Frank Olken, Doron Rotem
IROS
2006
IEEE
166views Robotics» more  IROS 2006»
14 years 3 months ago
Anytime RRTs
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
Dave Ferguson, Anthony Stentz
SOFSEM
2007
Springer
14 years 3 months ago
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Ku...