Sciweavers

44 search results - page 6 / 9
» A sparse algorithm for dense optimal transport
Sort
View
DOLAP
2003
ACM
14 years 3 months ago
Attribute value reordering for efficient hybrid OLAP
The normalization of a data cube is the process of choosing an ordering for the attribute values, and the chosen ordering will affect the physical storage of the cube’s data. For...
Owen Kaser, Daniel Lemire
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 2 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 11 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
FSKD
2007
Springer
193views Fuzzy Logic» more  FSKD 2007»
14 years 4 months ago
Panoramic Background Model under Free Moving Camera
segmentation of moving regions in outdoor environment under a moving camera is a fundamental step in many vision systems including automated visual surveillance, human-machine int...
Naveed I. Rao, Huijun Di, Guangyou Xu
SAC
2004
ACM
14 years 3 months ago
Statistical properties of transactional databases
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
Paolo Palmerini, Salvatore Orlando, Raffaele Pereg...