Sciweavers

11212 search results - page 46 / 2243
» Semi-persistent Data Structures
Sort
View
AAAI
2007
13 years 10 months ago
Data Structures for Generalised Arc Consistency for Extensional Constraints
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
CIMAGING
2008
141views Hardware» more  CIMAGING 2008»
13 years 9 months ago
Segmentation of digital microscopy data for the analysis of defect structures in materials using nonlinear diffusions
We apply stabilized inverse diffusion equations (SIDEs) to segment microscopy images of materials to aid in analysis of defects. We extend SIDE segmentation methods and demonstrat...
Landis M. Huffman, Jeff P. Simmons, Ilya Pollak
PPSC
2001
13 years 9 months ago
A Mathematical Cache Miss Analysis for Pointer Data Structures
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
Hongli Zhang, Margaret Martonosi
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 9 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
TCAD
1998
161views more  TCAD 1998»
13 years 7 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker