Sciweavers

14078 search results - page 293 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
DKE
2002
218views more  DKE 2002»
15 years 6 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 10 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 7 months ago
Privacy preserving regression modelling via distributed computation
Reluctance of data owners to share their possibly confidential or proprietary data with others who own related databases is a serious impediment to conducting a mutually beneficia...
Ashish P. Sanil, Alan F. Karr, Xiaodong Lin, Jerom...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 10 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 6 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung