Sciweavers

16404 search results - page 652 / 3281
» A set coverage problem
Sort
View
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
16 years 4 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
TARK
2007
Springer
16 years 1 months ago
Dealing with logical omniscience
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
Joseph Y. Halpern, Riccardo Pucella
ISNN
2004
Springer
16 years 16 days ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
LATIN
1998
Springer
15 years 11 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner
SOFSEM
1998
Springer
15 years 11 months ago
The Reconstruction of Convex Polyominoes from Horizontal and Vertical Projections
Abstract. The problem of reconstructing a discrete set from its horizontal and vertical projections (RSP) is of primary importance in many different problems for example pattern re...
Maciej Gebala