Sciweavers

92 search results - page 7 / 19
» Bottleneck Domination and Bottleneck Independent Domination ...
Sort
View
77
Voted
USENIX
1993
15 years 1 months ago
Measurement, Analysis, and Improvement of UDP/IP Throughput for the DECstation 5000
Networking software is a growing bottleneck in modern workstations, particularly for high throughput applications such as networked digital video. We measure various components of...
Jonathan Kay, Joseph Pasquale
UAI
2004
15 years 1 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
101
Voted
DM
2007
101views more  DM 2007»
15 years 12 days ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans
61
Voted
ISCAS
2003
IEEE
89views Hardware» more  ISCAS 2003»
15 years 5 months ago
DCT-based video frame-skipping transcoder
Due to high computational complexity and quality degradation introduced by conventional frame-skipping transcoders, a DCT-based video frame-skipping transcoder is proposed recentl...
Kai-Tat Fung, Wan-Chi Siu
115
Voted
CCCG
2010
15 years 1 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...