1554 search results - page 124 / 311 » Parameterized Complexity and Approximation Algorithms |
144
click to vote
PE
2010
Springer
15 years 2 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
126
Voted
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
129
Voted
CGF
2005
15 years 3 months ago
2005
Aiming at robust surface structure recovery, we extend the powerful optimization technique of variational shape approximation by allowing for several different primitives to repre...
136
Voted
ICISC
2008
2008
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
15 years 5 months ago
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
135
Voted
DAC
2011
ACM
14 years 3 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...