Sciweavers

4114 search results - page 3 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
IANDC
2010
58views more  IANDC 2010»
13 years 4 months ago
Efficient algorithms for the block edit problems
Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, B...
TALG
2010
93views more  TALG 2010»
13 years 14 days ago
Efficient algorithms for the 2-gathering problem
Alon Shalita, Uri Zwick
FOCS
1991
IEEE
13 years 9 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 15 days ago
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
Jie Shen, Haijun Yu