10608 search results - page 534 / 2122 » Complexity of O'Hara's Algorithm |
176
click to vote
COCO
2005
Springer
16 years 18 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
199
click to vote
COMPGEOM
2003
ACM
16 years 9 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
181
click to vote
CCR
2004
15 years 7 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
184
click to vote
WAE
1998
15 years 8 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
186
click to vote
ANSS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...