Sciweavers

2100 search results - page 167 / 420
» Fundamentals of the problem
Sort
View
DIS
2006
Springer
15 years 4 months ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
ESA
2006
Springer
92views Algorithms» more  ESA 2006»
15 years 4 months ago
Out-of-Order Event Processing in Kinetic Data Structures
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...
Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg...
ETRICS
2006
15 years 4 months ago
Privacy-Preserving Decision Tree Mining Based on Random Substitutions
Privacy-preserving decision tree mining is an important problem that has yet to be thoroughly understood. In fact, the privacypreserving decision tree mining method explored in the...
Jim Dowd, Shouhuai Xu, Weining Zhang
EUROPAR
2006
Springer
15 years 4 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
OHS
2000
Springer
15 years 4 months ago
Standardizing Hypertext: Where Next for OHP?
Abstract. Over the last six years the Open Hypermedia Systems Working Group (OHSWG) has been working in a coordinated effort to produce a protocol which will allow components of an...
David E. Millard, Hugh C. Davis, Luc Moreau