Sciweavers

431 search results - page 73 / 87
» An information global minimization algorithm using the local...
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 3 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
IPM
2007
156views more  IPM 2007»
13 years 8 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...
ASPDAC
2007
ACM
123views Hardware» more  ASPDAC 2007»
14 years 18 days ago
Coupling-aware Dummy Metal Insertion for Lithography
As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip...
Liang Deng, Martin D. F. Wong, Kai-Yuan Chao, Hua ...
CORR
2008
Springer
142views Education» more  CORR 2008»
13 years 8 months 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.
EMSOFT
2004
Springer
14 years 2 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross