Sciweavers

597 search results - page 11 / 120
» New Algorithms for Improved Transcendental Functions on IA-6...
Sort
View
ICCV
2003
IEEE
14 years 10 months ago
A New Perspective [on] Shape-from-Shading
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. The vast majority of research in this field have assumed orthography as its projection model. This paper re-e...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
SIGOPS
2008
162views more  SIGOPS 2008»
13 years 8 months ago
CUBIC: a new TCP-friendly high-speed TCP variant
CUBIC is a congestion control protocol for TCP (transmission control protocol) and the current default TCP algorithm in Linux. The protocol modifies the linear window growth funct...
Sangtae Ha, Injong Rhee, Lisong Xu
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 3 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
FOCS
2006
IEEE
14 years 2 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
BMCBI
2005
125views more  BMCBI 2005»
13 years 8 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...