Sciweavers

36 search results - page 6 / 8
» Ritt-Wu's Decomposition Algorithm and Geometry Theorem Provi...
Sort
View
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 1 days ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
FOCS
2003
IEEE
15 years 2 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
IMR
2003
Springer
15 years 2 months ago
A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
Suzanne M. Shontz, Stephen A. Vavasis
TSMC
2002
112views more  TSMC 2002»
14 years 9 months ago
An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
Liang Chen, Naoyuki Tokuda
81
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 4 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker