1554 search results - page 129 / 311 » Parameterized Complexity and Approximation Algorithms |
136
click to vote
STOC
1993
ACM
15 years 7 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...
229
Voted
ICDE
2007
IEEE
16 years 5 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...
133
Voted
CAD
2005
Springer
15 years 3 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...
138
Voted
PODS
2005
ACM
15 years 9 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...
156
Voted
EAAI
2010
15 years 2 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...