Sciweavers

4536 search results - page 171 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
APVIS
2007
13 years 10 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
IAJIT
2008
123views more  IAJIT 2008»
13 years 9 months ago
Vectorial Information Structuring for Documents Filtering and Diffusion
: Information retrieval tries to identify relevant documents for an information need. The problems that an IR system should deal with include document indexing (which tries to extr...
Omar Nouali, Abdelghani Krinah
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
APPML
2002
58views more  APPML 2002»
13 years 9 months ago
Layered clusters of tightness set functions
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
Boris Mirkin, Ilya B. Muchnik
CGF
1998
134views more  CGF 1998»
13 years 9 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...