Sciweavers

727 search results - page 139 / 146
» Private approximation of search problems
Sort
View
CIKM
1999
Springer
14 years 2 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 1 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 11 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
TMM
2010
270views Management» more  TMM 2010»
13 years 4 months ago
Sequence Multi-Labeling: A Unified Video Annotation Scheme With Spatial and Temporal Context
Abstract--Automatic video annotation is a challenging yet important problem for content-based video indexing and retrieval. In most existing works, annotation is formulated as a mu...
Yuanning Li, YongHong Tian, Ling-Yu Duan, Jingjing...
SIGMOD
2011
ACM
269views Database» more  SIGMOD 2011»
13 years 19 days ago
Advancing data clustering via projective clustering ensembles
Projective Clustering Ensembles (PCE) are a very recent advance in data clustering research which combines the two powerful tools of clustering ensembles and projective clustering...
Francesco Gullo, Carlotta Domeniconi, Andrea Tagar...