Sciweavers

4536 search results - page 34 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CVPR
2010
IEEE
13 years 5 months ago
P-N learning: Bootstrapping binary classifiers by structural constraints
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
Zdenek Kalal, Jiri Matas, Krystian Mikolajczyk
ICIP
2006
IEEE
14 years 9 months 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
FGCS
2006
125views more  FGCS 2006»
13 years 7 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
PVLDB
2008
146views more  PVLDB 2008»
13 years 7 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 9 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...