Sciweavers

1265 search results - page 76 / 253
» Algorithms for Drawing Media
Sort
View
DCC
2005
IEEE
15 years 11 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
FOCS
2006
IEEE
15 years 6 months ago
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
ISSAC
1989
Springer
77views Mathematics» more  ISSAC 1989»
15 years 3 months ago
A Parallel Implementation of the Cylindrical Algebraic Decomposition Algorithm
In this paper, we describe a parallelization scheme for Collins’ cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. ...
B. David Saunders, Hong R. Lee, S. Kamal Abdali
COMPGEOM
2003
ACM
15 years 5 months ago
Curve reconstruction from noisy samples
We present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing po...
Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, P...
GD
2009
Springer
15 years 4 months ago
Leftist Canonical Ordering
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
Melanie Badent, Michael Baur, Ulrik Brandes, Sabin...