Sciweavers

2957 search results - page 460 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
INFOCOM
2000
IEEE
15 years 10 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 10 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
SIGGRAPH
1998
ACM
15 years 10 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
INFOCOM
1997
IEEE
15 years 10 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 10 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng