1554 search results - page 113 / 311 » Parameterized Complexity and Approximation Algorithms |
241
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
154
click to vote
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
15 years 3 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
127
click to vote
ICCAD
2003
IEEE
16 years 18 days ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
133
click to vote
SIGGRAPH
1992
ACM
15 years 7 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
173
click to vote
EEF
2000
15 years 7 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...