نتایج جستجو برای: pair wise least significant bit matching

تعداد نتایج: 1779437  

Journal: :CoRR 2012
Rajdeep Borgohain

-------------------------------------------------------------------ABSTRACT-----------------------------------------------------------------Data hiding is the art of embedding data into digital media in a way such that the existence of data remains concealed from everyone except the intended recipient. In this paper, we discuss the various Least Significant Bit (LSB) data hiding techniques. We ...

Journal: :CSRID (Computer Science Research and Its Development Journal) 2016

Journal: :Journal of Advanced College of Engineering and Management 2016

Journal: :Discrete & Computational Geometry 2015
Victor Alvarez Karl Bringmann Radu Curticapean Saurabh Ray

Let P be a set of n points in the plane. A crossing-free structure on P is a plane graph with vertex set P . Examples of crossing-free structures include triangulations of P , spanning cycles of P , also known as polygonalizations of P , among others. There has been a large amount of research trying to bound the number of such structures. In particular, bounding the number of (straight-edge) tr...

Journal: :Jurnal Sains dan Teknologi: Jurnal Keilmuan dan Aplikasi Teknologi Industri 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید