4850 search results - page 492 / 970 » Approximate Data Structures with Applications |
209
Voted
KDD
2005
ACM
16 years 8 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
197
click to vote
DAC
2004
ACM
16 years 8 months ago
2004
ACM
Massive data transfer encountered in emerging multimedia embedded applications requires architecture allowing both highly distributed memory structure and multiprocessor computati...
241
click to vote
ICDM
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
250
click to vote
BMCBI
2008
15 years 7 months ago
2008
Complexity of post-genomic data and multiplicity of mining strategies are two limits to Knowledge Discovery in Databases (KDD) in life sciences. Because they provide a semantic fr...
240
click to vote
ECCV
2004
Springer
16 years 9 months ago
2004
Springer
In this paper, we propose a new PDE-based methodology for deformable surfaces that is capable of automatically evolving its shape to capture the geometric boundary of the data and ...