Sciweavers

1201 search results - page 228 / 241
» Exact Analysis of Exact Change
Sort
View
INFOVIS
2002
IEEE
14 years 16 days ago
Visualizing Data with Bounded Uncertainty
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
Chris Olston, Jock D. Mackinlay
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 12 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SYSTOR
2010
ACM
14 years 12 days ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
IDMS
2001
Springer
116views Multimedia» more  IDMS 2001»
14 years 1 days ago
The Minimal Buffering Requirements of Congestion Controlled Interactive Multimedia Applications
This paper uses analysis and experiments to study the minimal buffering requirements of congestion controlled multimedia applications. Applications in the Internet must use congest...
Kang Li, Charles Krasic, Jonathan Walpole, Molly H...
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum