Sciweavers

36 search results - page 7 / 8
» Polynomial Reproduction in Subdivision
Sort
View
DAGSTUHL
1997
15 years 1 months ago
Scattered Data Techniques for Surfaces
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
Suresh K. Lodha, Richard Franke
CAGD
2002
98views more  CAGD 2002»
14 years 11 months ago
Comparison of interval methods for plotting algebraic curves
This paper compares the performance and efficiency of different function range interval methods for plotting f(x, y) = 0 on a rectangular region based on a subdivision scheme, whe...
Ralph R. Martin, Huahao Shou, Irina Voiculescu, Ad...
93
Voted
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 11 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SIAMDM
1998
95views more  SIAMDM 1998»
14 years 11 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan