Sciweavers

2609 search results - page 390 / 522
» Optimizing for parallelism and data locality
Sort
View
129
Voted
NIPS
2001
15 years 2 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
104
Voted
DAC
2008
ACM
15 years 2 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
129
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 24 days ago
On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algor...
Rahul Vaze, Robert W. Heath Jr.
131
Voted
TCOM
2008
192views more  TCOM 2008»
15 years 19 days ago
Joint source coding, routing and power allocation in wireless sensor networks
This paper proposes a cross-layer optimization framework for the wireless sensor networks. In a wireless sensor network, each sensor makes a local observation of the underlying phy...
Jun Yuan, Wei Yu
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 4 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant