2957 search results - page 214 / 592 » The Complexity of Polynomial-Time Approximation |
178
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
145
click to vote
RSCTC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
173
click to vote
WSCG
2003
15 years 8 months ago
2003
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...
152
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
162
click to vote
FUIN
2002
15 years 6 months ago
2002
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...