Sciweavers

203 search results - page 38 / 41
» The Good, the Bad, and the Ugly
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 1 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
95
Voted
DCC
2004
IEEE
15 years 1 months ago
Adaptive Rate Control Scheme for Video Streaming Over Wireless Channels
Providing continuous video playback with graceful quality degradation over wireless channels is fraught with challenges. Video applications require stringent delay guarantees and ...
Marwan Krunz, Mohamed Hassan
82
Voted
PRICAI
2000
Springer
15 years 1 months ago
Discovery of Shared Topics Networks among People - A Simple Approach to Find Community Knowledge from WWW Bookmarks
In this paper, we propose a system called kMedia that can assist users to form knowledge for community by showing shared topics networks (STN) among them. One of the important aspe...
Hideaki Takeda, Takeshi Matsuzuka, Yuichiro Tanigu...
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang