نتایج جستجو برای: eternal m security subdivision number

تعداد نتایج: 1787002  

Journal: :Math. Comput. 1999
Richard Baltensperger Jean-Paul Berrut Benjamin Noël

In 1988 the second author presented experimentally well-conditioned linear rational functions for global interpolation. We give here arrays of nodes for which one of these interpolants converges exponentially for analytic functions Introduction Let f be a complex function defined on an interval I of the real axis and let x0, x1, . . . , xn be n + 1 distinct points of I, which we do not assume e...

2010
Hui Zhang Jun-Hai Yong

We propose an adaptive geometry compression method with labels based on 4-point interpolatory subdivision schemes. It can work on digital curves of arbitrary dimensions. With the geometry compression method, a digital curve is adaptively compressed into several segments with different compression levels. Each segment is a 4-point subdivision curve with a subdivision step. Labels are recorded in...

2010
Fabio Martinelli Paolo Masci Ilaria Matteucci Hongyang Qu Mark Rouncefield Rachid Saadi Antonino Sabetta Romina Spalazzese Francois Taiani

This is the first deliverable of WP5, which covers Conceptual Models for Assessment & Assurance of Dependability, Security and Privacy in the Eternal CONNECTed World. As described in the project DOW, in this document we cover the following topics: • Metrics definition • Identification of limitations of current V&V approaches and exploration of extensions/refinements/new developments • Identific...

2008
Yevgeny Schreiber

In this thesis we develop optimal-time algorithms for computing shortest paths on polyhedral surfaces in three dimensions. Specifically: • We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm, which settles a major problem that has been open for more...

2010
Peter Grosche Meinard Müller Craig Stuart Sapp

The automated extraction of tempo and beat information from music recordings is a challenging task. Especially in the case of expressive performances, current beat tracking approaches still have significant problems to accurately capture local tempo deviations and beat positions. In this paper, we introduce a novel evaluation framework for detecting critical passages in a piece of music that ar...

Journal: :Computer Aided Geometric Design 2008
Ashish Myles Kestutis Karciauskas Jörg Peters

Surface constructions of polynomial degree (3,3) come in four flavours that complement each other: one pair extends the subdivision paradigm, the other the NURBS patch approach to free-form modeling. The first pair, Catmull-Clark (Catmull and Clark, 1978) and Polar subdivision (Karčiauskas and Peters, 2007) generalize bi-cubic subdivision: While Catmull-Clark subdivision is more suitable where ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید