1554 search results - page 129 / 311 » Parameterized Complexity and Approximation Algorithms |
174
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
265
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
171
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
173
click to vote
PODS
2005
ACM
15 years 12 months ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
195
click to vote
EAAI
2010
15 years 4 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...