1552 search results - page 89 / 311 » On the Complexity of Constant Propagation |
178
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
218
click to vote
TIP
2010
15 years 4 months ago
2010
Abstract—This study investigates level set multiphase image segmentation by kernel mapping and piecewise constant modeling of the image data thereof. A kernel function maps impli...
166
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
164
click to vote
DCG
2006
15 years 6 months ago
2006
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the inpu...
142
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Modeling complex compositional objects in the field of the life sciences requires to solve intricate ontological problems, especially those related to parts of a whole, space and...