Sciweavers

2766 search results - page 459 / 554
» Algorithms for trigonometric polynomials
Sort
View
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 10 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
ASPDAC
2009
ACM
164views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Accounting for non-linear dependence using function driven component analysis
Majority of practical multivariate statistical analyses and optimizations model interdependence among random variables in terms of the linear correlation among them. Though linear...
Lerong Cheng, Puneet Gupta, Lei He
112
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
Throughput and Delay of DSL Dynamic Spectrum Management with Dynamic Arrivals
Abstract—In modern DSL networks, crosstalk among different lines (i.e., users) is the major source of performance degradation. Dynamic Spectrum Management (DSM) refers to a set o...
Paschalis Tsiaflakis, Yung Yi, Mung Chiang, Marc M...
INFOCOM
2008
IEEE
15 years 10 months ago
Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
QEST
2008
IEEE
15 years 10 months ago
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
Josée Desharnais, François Laviolett...