1469 search results - page 271 / 294 » Approximate polynomial decomposition |
TSMC
2010
14 years 4 months ago
2010
We study how the dependence of a simulation output on an uncertain parameter can be determined, when simulations are computationally expensive and so can only be run for very few p...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
82
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...