Sciweavers

833 search results - page 156 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 9 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CORR
2002
Springer
122views Education» more  CORR 2002»
13 years 8 months ago
Fair Stateless Aggregate Traffic Marking using Active Queue Management Techniques
Abstract--In heterogeneous networks such as today's Internet, the differentiated services architecture promises to provide QoS guarantees through scalable service differentiat...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy
JAIR
2007
120views more  JAIR 2007»
13 years 8 months ago
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Cédric Pralet, Gérard Verfaillie, Th...
SIGCOMM
2004
ACM
14 years 2 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
SIGCOMM
1997
ACM
14 years 1 months ago
Consistent Overhead Byte Stuffing
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
Stuart Cheshire, Mary Baker