Sciweavers

9871 search results - page 124 / 1975
» On the Structure of Low Sets
Sort
View
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 12 months ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
CCCG
2003
15 years 7 months ago
The Gaussian Centre of a Set of Mobile Points
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
Stephane Durocher, David G. Kirkpatrick
CORR
2010
Springer
320views Education» more  CORR 2010»
15 years 6 months ago
An algorithm for the principal component analysis of large data sets
Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy -- even on parallel processors -- unlike the...
Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnis...
PVLDB
2008
127views more  PVLDB 2008»
15 years 5 months ago
Hashed samples: selectivity estimators for set similarity selection queries
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
Marios Hadjieleftheriou, Xiaohui Yu, Nick Koudas, ...
ICDAR
2009
IEEE
15 years 4 months ago
A Unified Framework Based on the Level Set Approach for Segmentation of Unconstrained Double-Sided Document Images Suffering fro
A novel method for the segmentation of double-sided ancient document images suffering from bleed-through effect is presented. It takes advantage of the level set framework to prov...
Reza Farrahi Moghaddam, David Rivest-Hénaul...