Sciweavers

4850 search results - page 278 / 970
» Approximate Data Structures with Applications
Sort
View
FOIKS
2010
Springer
15 years 4 months ago
Two Complementary Classification Methods for Designing a Concept Lattice from Interval Data
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...
Mehdi Kaytoue-Uberall, Zainab Assaghir, Nizar Mess...
CIKM
2008
Springer
15 years 8 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
BMCBI
2007
128views more  BMCBI 2007»
15 years 6 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
15 years 10 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
ICIP
2008
IEEE
16 years 8 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci