Sciweavers

2766 search results - page 96 / 554
» Algorithms for trigonometric polynomials
Sort
View
107
Voted
WSCG
2003
136views more  WSCG 2003»
15 years 2 months ago
Piecewise Circular Approximation of Spirals and Polar Polynomials
Spirals are surprisingly common in science, nature, physics, astronomy, flora and fauna, and the arts. In Cartesian coordinates they are typically transcendental functions, which ...
Francesca Taponecco, Marc Alexa
CPC
2006
116views more  CPC 2006»
15 years 26 days ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
107
Voted
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
15 years 16 days ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
97
Voted
TSP
2011
106views more  TSP 2011»
14 years 7 months ago
Extended Target Tracking Using Polynomials With Applications to Road-Map Estimation
—This paper presents an extended target tracking framework which uses polynomials in order to model extended objects in the scene of interest from imagery sensor data. State spac...
Christian Lundquist, Umut Orguner, Fredrik Gustafs...
105
Voted
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 7 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl