Sciweavers

244 search results - page 19 / 49
» Fast Set Intersection in Memory
Sort
View
VMV
2001
132views Visualization» more  VMV 2001»
13 years 11 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
CHI
2010
ACM
14 years 1 months ago
A death in the family: opportunities for designing technologies for the bereaved
Following the death of a loved one, bereaved family members use technology in several ways to respond to their loss. However, very little is known about how technology intersects ...
Michael Massimi, Ronald M. Baecker
SBBD
2008
256views Database» more  SBBD 2008»
13 years 11 months ago
Indexing Internal Memory with Minimal Perfect Hash Functions
A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values, which are in turn used to index a hash table. Since no collisions occur, each k...
Fabiano C. Botelho, Hendrickson R. Langbehn, Guilh...
ITNG
2010
IEEE
14 years 3 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
BIRTHDAY
2012
Springer
12 years 5 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...