Sciweavers

11219 search results - page 111 / 2244
» Retroactive data structures
Sort
View
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 3 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»
15 years 2 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
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 2 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
IV
2005
IEEE
98views Visualization» more  IV 2005»
15 years 8 months ago
Exploring Highly Structured Data: A Comparative Study of Stardinates and Parallel Coordinates
Comparing different Information Visualization (InfoVis) techniques is a challenging task and a necessary step to reach the users and their tasks. We evaluated the effectiveness in...
Monika Lanzenberger, Silvia Miksch, Margit Pohl
EDBTW
2004
Springer
15 years 7 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...