4541 search results - page 552 / 909 » Cache-Oblivious Algorithms and Data Structures |
185
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
183
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
223
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
184
click to vote
FGR
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose an Isometric Self-Organizing Map (ISOSOM) method for nonlinear dimensionality reduction, which integrates a Self-Organizing Map model and an ISOMAP dimension reduction ...
188
click to vote
ICANNGA
2007
Springer
15 years 11 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...