Sciweavers

1451 search results - page 69 / 291
» Order independence and rationalizability
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 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
CORR
1998
Springer
106views Education» more  CORR 1998»
15 years 6 months ago
Lower Bounds for Quantum Search and Derandomization
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
Harry Buhrman, Ronald de Wolf
CCR
1999
91views more  CCR 1999»
15 years 6 months ago
On the effective evaluation of TCP
Understanding the performance of the Internet's Transmission Control Protocol (TCP) is important because it is the dominant protocol used in the Internet today. Various testi...
Mark Allman, Aaron Falk
CGF
1999
153views more  CGF 1999»
15 years 6 months ago
Comprehensive Halftoning of 3D Scenes
The display of images on binary output hardware requires a halftoning step. Conventional halftoning algorithms approximate image values independently from the image content and of...
Oleg Veryovka, John W. Buchanan
PAMI
1998
170views more  PAMI 1998»
15 years 6 months ago
Ordinal Measures for Image Correspondence
—We present ordinal measures of association for image correspondence in the context of stereo. Linear correspondence measures like correlation and the sum of squared difference b...
Dinkar N. Bhat, Shree K. Nayar