Sciweavers

1405 search results - page 46 / 281
» Popularity at Minimum Cost
Sort
View
138
Voted
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
15 years 3 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
JCB
2002
108views more  JCB 2002»
15 years 3 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
COMGEO
2006
ACM
15 years 4 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
AAAI
2006
15 years 5 months ago
On Multi-Class Cost-Sensitive Learning
Rescaling is possibly the most popular approach to cost-sensitive learning. This approach works by rescaling the classes according to their costs, and it can be realized in differ...
Zhi-Hua Zhou, Xu-Ying Liu
LATIN
2004
Springer
15 years 9 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse