Sciweavers

3946 search results - page 440 / 790
» The computational complexity of choice sets
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 8 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
DAC
2010
ACM
15 years 7 months ago
Virtual channels vs. multiple physical networks: a comparative analysis
Packet-switched networks-on-chip (NoC) have been proposed as an efficient communication infrastructure for multi-core architectures. Adding virtual channels to a NoC helps to avoi...
Young-Jin Yoon, Nicola Concer, Michele Petracca, L...
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
15 years 7 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
ECCB
2008
IEEE
15 years 7 months ago
Temporal logic patterns for querying dynamic models of cellular interaction networks
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
Pedro T. Monteiro, Delphine Ropers, Radu Mateescu,...
JSC
2008
162views more  JSC 2008»
15 years 6 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...