Sciweavers

11231 search results - page 58 / 2247
» Digging for Data Structures
Sort
View
ICIP
2006
IEEE
16 years 25 days ago
Hierarchical Data Structure for Real-Time Background Subtraction
This paper seeks to increase the efficiency of background subtraction algorithms for motion detection. Our method uses a quadtree-base hierarchical framework that samples a small ...
Johnny Park, Amy Tabb, Avinash C. Kak
SIGSOFT
1994
ACM
15 years 3 months ago
Reengineering a Complex Application Using a Scalable Data Structure Compiler
1 P2 is a scalable compiler for collection data structures. High-level ions insulate P2 users from data structure implementation details. By specifying a target data structure as a...
Don S. Batory, Jeff Thomas, Marty Sirkin
NIPS
2003
15 years 16 days ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda
TOIS
2002
97views more  TOIS 2002»
14 years 10 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
DDEP
2000
Springer
15 years 3 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt