Sciweavers

413 search results - page 34 / 83
» Lattice Boltzmann Method
Sort
View
IACR
2011
136views more  IACR 2011»
12 years 8 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 10 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
TIFS
2008
152views more  TIFS 2008»
13 years 8 months ago
Security of Lattice-Based Data Hiding Against the Watermarked-Only Attack
This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works to a more general scenario. The se...
Luis Pérez-Freire, Fernando Pérez-Go...
ICFCA
2009
Springer
14 years 3 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
SIGSOFT
1998
ACM
14 years 22 days ago
Reengineering Class Hierarchies Using Concept Analysis
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Gregor Snelting, Frank Tip