Sciweavers

13214 search results - page 2632 / 2643
» Pseudorandomness for network algorithms
Sort
View
JNCA
2007
154views more  JNCA 2007»
13 years 7 months ago
Knowledge-based multimedia adaptation for ubiquitous multimedia consumption
Intelligent, server-side adaptation of multimedia resources is becoming increasingly important and challenging for two reasons. First, the market continuously brings up new mobile...
Dietmar Jannach, Klaus Leopold
TWC
2008
99views more  TWC 2008»
13 years 7 months ago
Robust transmit processing for frequency-selective fading channels with imperfect channel feedback
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
Christof Jonietz, Wolfgang H. Gerstacker, Robert S...
VLSISP
2008
173views more  VLSISP 2008»
13 years 7 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
MAM
2007
99views more  MAM 2007»
13 years 7 months ago
Laboratory-based calibration of available bandwidth estimation tools
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool ...
Joel Sommers, Paul Barford, Walter Willinger
« Prev « First page 2632 / 2643 Last » Next »