Sciweavers

607 search results - page 29 / 122
» Unifying Exact Completions
Sort
View
76
Voted
UAI
2008
15 years 10 days ago
The Computational Complexity of Sensitivity Analysis and Parameter Tuning
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
Johan Kwisthout, Linda C. van der Gaag
70
Voted
ENDM
2008
81views more  ENDM 2008»
14 years 11 months ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...
ICCD
2004
IEEE
148views Hardware» more  ICCD 2004»
15 years 7 months ago
Many-to-Many Core-Switch Mapping in 2-D Mesh NoC Architectures
In this paper, we investigate the core-switch mapping(CSM) problem that optimally maps cores onto an NoC architecture such that either the energy consumption or the congestion is ...
Chan-Eun Rhee, Han-You Jeong, Soonhoi Ha
77
Voted
ICALP
1997
Springer
15 years 3 months ago
The Theory of Vaccines
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
Massimo Marchiori
TIT
2008
121views more  TIT 2008»
14 years 10 months ago
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...