Sciweavers

375 search results - page 45 / 75
» Accelerated spectral approximation
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ICCAD
2008
IEEE
223views Hardware» more  ICCAD 2008»
14 years 4 months ago
Decoupling capacitance allocation for timing with statistical noise model and timing analysis
Abstract— This paper presents an allocation method of decoupling capacitance that explicitly considers timing. We have found and focused that decap does not necessarily improve a...
Takashi Enami, Masanori Hashimoto, Takashi Sato
ASIAMS
2008
IEEE
14 years 2 months ago
High-Performance Carry Select Adder Using Fast All-One Finding Logic
A carry-select adder(CSA) can be implemented by using single ripple carry adder and an add-one circuit instead of using dual ripple-carry adders to reduce the area and power but w...
Sun Yan, Zhang Xin, Jin Xi
FDL
2008
IEEE
14 years 2 months ago
VHDL-AMS Implementation of a Numerical Ballistic CNT Model for Logic Circuit Simulation
—This paper introduces a novel numerical carbon nanotube transistor (CNT) modelling approach which brings in a flexible and efficient cubic spline non-linear approximation of t...
Dafeng Zhou, Tom J. Kazmierski, Bashir M. Al-Hashi...
ICCS
2007
Springer
14 years 2 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva