Sciweavers

570 search results - page 101 / 114
» A Connectivity Constraint Using Bridges
Sort
View
PAMI
2007
154views more  PAMI 2007»
13 years 8 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
CP
2010
Springer
13 years 6 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
13 years 6 months ago
Throughput-Effective On-Chip Networks for Manycore Accelerators
As the number of cores and threads in manycore compute accelerators such as Graphics Processing Units (GPU) increases, so does the importance of on-chip interconnection network des...
Ali Bakhoda, John Kim, Tor M. Aamodt
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 9 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
SIGCOMM
2004
ACM
14 years 2 months ago
A first-principles approach to understanding the internet's router-level topology
A detailed understanding of the many facets of the Internet’s topological structure is critical for evaluating the performance of networking protocols, for assessing the effecti...
Lun Li, David Alderson, Walter Willinger, John Doy...