Sciweavers

2570 search results - page 447 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ICNP
1997
IEEE
15 years 2 months ago
TCP behavior with many flows
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
Robert Morris
FOCS
1989
IEEE
15 years 2 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ACMICEC
2007
ACM
107views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
A family of growth models for representing the price process in online auctions
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...
Valerie Hyde, Wolfgang Jank, Galit Shmueli
DOCENG
2007
ACM
15 years 1 months ago
Thresholding of badly illuminated document images through photometric correction
This paper presents a document image thresholding technique that binarizes badly illuminated document images by the photometric correction. Based on the observation that illuminat...
Shijian Lu, Chew Lim Tan
ICDCS
2010
IEEE
15 years 1 months ago
A New Buffer Cache Design Exploiting Both Temporal and Content Localities
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
Jin Ren, Qing Yang