268 search results - page 23 / 54 » Cleaning Interval Graphs |
CAGD
2007
14 years 10 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
RC
2000
14 years 10 months ago
2000
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
91
Voted
JMLR
2010
14 years 5 months ago
2010
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
JCT
2007
14 years 10 months ago
2007
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...