Sciweavers

169 search results - page 4 / 34
» Point to Point GALS Interconnect
Sort
View
CN
2004
150views more  CN 2004»
13 years 10 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
CGF
2004
151views more  CGF 2004»
13 years 10 months ago
Deferred Splatting
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 7 months ago
On the Optimality of Spiral Search
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
Elmar Langetepe
ISCAS
2007
IEEE
144views Hardware» more  ISCAS 2007»
14 years 4 months ago
Quasi-Resonant Interconnects: A Low Power Design Methodology
— Design and analysis guidelines for resonant interconnect networks are presented in this paper. The methodology focuses on developing an accurate analytic distributed model of t...
Jonathan Rosenfeld, Eby G. Friedman
PPL
2002
93views more  PPL 2002»
13 years 10 months ago
Embedding of Fault-Tolerant Trees in the Josephus Cube
The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failu...
Peter K. K. Loh, Wen-Jing Hsu