Sciweavers

3096 search results - page 31 / 620
» The Generalized FITC Approximation
Sort
View
PG
2007
IEEE
14 years 2 months ago
Papercraft Models using Generalized Cylinders
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
Fady Massarwi, Craig Gotsman, Gershon Elber
INFOCOM
2010
IEEE
13 years 7 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
ATAL
2010
Springer
13 years 3 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ECCC
2000
93views more  ECCC 2000»
13 years 8 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
TCOS
2010
13 years 7 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...