Sciweavers

12825 search results - page 46 / 2565
» Improved PLSOM algorithm
Sort
View
CGI
2006
IEEE
14 years 2 months ago
Improving the Interval Ray Tracing of Implicit Surfaces
This paper presents a fast and reliable method to trim non-solution regions in an interval ray tracing process. The “trimming algorithm” uses interval analysis to perform rejec...
Jorge Flórez, Mateu Sbert, Miguel Án...
PASTE
2004
ACM
14 years 2 months ago
An improved slicer for Java
We present an improved slicing algorithm for Java. The best algorithm known so far, first presented in [11], is not always precise if nested objects are used as actual parameters...
Christian Hammer, Gregor Snelting
CLUSTER
2008
IEEE
14 years 3 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 11 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
AAIM
2008
Springer
131views Algorithms» more  AAIM 2008»
14 years 3 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
Zhi-Zhong Chen, Ruka Tanahashi