Sciweavers

973 search results - page 81 / 195
» New Bounds on Crossing Numbers
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
14 years 11 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
BMCBI
2011
14 years 3 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
14 years 9 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
ICCV
2005
IEEE
16 years 1 months ago
An Enhanced Correlation-Based Method for Stereo Correspondence with Sub-Pixel Accuracy
The invariance of the similarity measure in photometric distortions as well as its capability in producing subpixel accuracy are two desired and often required features in most st...
Emmanouil Z. Psarakis, Georgios D. Evangelidis
ICPR
2006
IEEE
16 years 1 months ago
Subpixel Alignment of MRI Data Under Cartesian and Log-Polar Sampling
Magnetic resonance imaging (MRI) allows numerous Fourier domain sampling schemes such as Cartesian and non-Cartesian trajectories (e.g. Polar, circular, and spherical). On the oth...
Hassan Foroosh, Mais Alnasser, Murat Balci