Sciweavers

829 search results - page 73 / 166
» A new watermarking approach for relational data
Sort
View
NPIV
1998
ACM
101views Visualization» more  NPIV 1998»
15 years 2 months ago
Supporting dynamic information visualization with VRML and databases
Nowadays, many state-of-the-art user interfaces to complexly structured data collections require appropriate information visualization methods. With the increase in graphics perfo...
Thomas Risse, Martin Leissler, Matthias Hemmje, Ka...
ER
1994
Springer
121views Database» more  ER 1994»
15 years 2 months ago
An Executable Meta Model for Re-Engineering of Database Schemas
A logical database schema, e.g. a relational one, is an implementation of a speci cation, e.g. an entity-relationship diagram. Upcoming new data models and the necessity of seamle...
Manfred A. Jeusfeld, Uwe A. Johnen
IPPS
2002
IEEE
15 years 2 months ago
Parallel Incremental 2D-Discretization on Dynamic Datasets
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
Srinivasan Parthasarathy, Arun Ramakrishnan
ICMCS
2008
IEEE
173views Multimedia» more  ICMCS 2008»
15 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
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
15 years 7 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim