1469 search results - page 127 / 294 » Approximate polynomial decomposition |
PG
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce QAS, an efficient quadratic approximation of subdivision surfaces which offers a very close appearance compared to the true subdivision surface but avoids recursion,...
ICDT
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
FOCS
2004
IEEE
15 years 1 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 ...
IJAR
2008
14 years 10 months ago
2008
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
106
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...