Sciweavers

786 search results - page 117 / 158
» An Efficient k-Means Clustering Algorithm: Analysis and Impl...
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
CAP
2010
13 years 3 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ICML
2009
IEEE
14 years 9 months ago
A least squares formulation for a class of generalized eigenvalue problems in machine learning
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...
Liang Sun, Shuiwang Ji, Jieping Ye
CIVR
2008
Springer
222views Image Analysis» more  CIVR 2008»
13 years 10 months ago
Automatic image annotation via local multi-label classification
As the consequence of semantic gap, visual similarity does not guarantee semantic similarity, which in general is conflicting with the inherent assumption of many generativebased ...
Mei Wang, Xiangdong Zhou, Tat-Seng Chua
JCP
2008
162views more  JCP 2008»
13 years 8 months ago
A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
Youyao Liu, Jungang Han, Huimin Du