Sciweavers

1693 search results - page 47 / 339
» fast 2008
Sort
View
TVLSI
2008
105views more  TVLSI 2008»
13 years 8 months ago
Fast Estimation of Timing Yield Bounds for Process Variations
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Max...
Ruiming Chen, Hai Zhou
TWC
2008
124views more  TWC 2008»
13 years 8 months ago
Reverse Link Performance of a DS-CDMA System With Both Fast and Slow Power Controlled Users
In this paper the performance of the reverse link of a multicell DS-CDMA system with coexisting open-loop and closed-loop power controlled users transmitting heterogeneous traffic ...
Loren Carrasco, Guillem Femenias
CGF
2004
89views more  CGF 2004»
13 years 8 months ago
Fast Multipath Radiosity using Hierarchical Subscenes
This paper presents an efficient acceleration technique for the global line radiosity Multipath method. In this approach, the scene is subdivided in a hierarchy of box bounded sub...
Francesc Castro, Mateu Sbert, László...
CPC
2000
93views more  CPC 2000»
13 years 8 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
DKE
2002
94views more  DKE 2002»
13 years 8 months ago
Tie-breaking strategies for fast distance join processing
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
Hyoseop Shin, Bongki Moon, Sukho Lee