Sciweavers

2924 search results - page 280 / 585
» Lower Bounds in Distributed Computing
Sort
View
WWW
2004
ACM
16 years 5 months ago
Outlink estimation for pagerank computation under missing data
The enormity and rapid growth of the web-graph forces quantities such as its pagerank to be computed under missing information consisting of outlinks of pages that have not yet be...
Sreangsu Acharyya, Joydeep Ghosh
ISPD
2000
ACM
139views Hardware» more  ISPD 2000»
15 years 8 months ago
Critical area computation for missing material defects in VLSI circuits
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
Evanthia Papadopoulou
DATE
2008
IEEE
99views Hardware» more  DATE 2008»
15 years 10 months ago
Thermal Balancing Policy for Streaming Computing on Multiprocessor Architectures
As feature sizes decrease, power dissipation and heat generation density exponentially increase. Thus, temperature gradients in Multiprocessor Systems on Chip (MPSoCs) can serious...
Fabrizio Mulas, Michele Pittau, Marco Buttu, Salva...
BMCBI
2006
84views more  BMCBI 2006»
15 years 4 months ago
Representation of target-bound drugs by computed conformers: implications for conformational libraries
Background: The increasing number of known protein structures provides valuable information about pharmaceutical targets. Drug binding sites are identifiable and suitable lead com...
Stefan Günther, Christian Senger, Elke Michal...
IRI
2008
IEEE
15 years 10 months ago
Computation with imprecise probabilities
abstract An imprecise probability distribution is an instance of second-order uncertainty, that is, uncertainty about uncertainty, or uncertainty for short. Another instance is an ...
Lotfi A. Zadeh