Results 1  10
of
23
Routing in Multihop Packet Switching Networks: Gbps Challenge
 IEEE Network
, 1995
"... The paper is a survey of networking solutions that have been proposed for highspeed packetswitched applications. Using these solutions as examples, we identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of highspeed networ ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
The paper is a survey of networking solutions that have been proposed for highspeed packetswitched applications. Using these solutions as examples, we identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of highspeed networks and protocols. We conclude that the solutions based on deflection routing are the most promising ones and we suggest a number of directions for their evolution. 1 Introduction Not so long ago, computer networks with high transmission rates (e.g. several Mb/s) were naturally confined to local domains. Although such (and higher) transmission rates were available in telephony on long distances, they were used on a pointtopoint basis. Concepts of highlyconnected fast networks spanning geographical areas larger than the acreage typically covered by a single institution are relatively new and, besides the emerging atm technology, there are no standard commercially available solutions that c...
Image Recoloring Induced by Palette Color Associations
 Journal of WSCG
, 2003
"... In this paper we present a noninteractive method for recoloring a destination image according to the color scheme found in a source image. The approach is motivated by trying to invert the working process employed in oil painting, and results are demonstrated by application to several wellknown oi ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
(Show Context)
In this paper we present a noninteractive method for recoloring a destination image according to the color scheme found in a source image. The approach is motivated by trying to invert the working process employed in oil painting, and results are demonstrated by application to several wellknown oil paintings. The algorithm uses several color models, but leans most heavily on the L## color space. We first color segment each image bottomup by iteratively merging groups of pixels into connected regions of similar color. During color segmentation, a color "texture" tree is generated and associated to each region. Next, we construct classes of regions by compensating for color duplication and color similarity within the set of averaged color values obtained from regions. We extract a color palette for each image by choosing the colors of canonical region representatives from these classes. Once this palette is constructed for each image, any inverse map from the set of destination palette colors to the set of source palette colors induces a forward map from the classes of regions in the source image to sets of classes of regions in the destination image. For each source class in the range of the inverse map we transfer color from its canonical region representative to each of the associated destination regions. Color transfer occurs at the level of pixels, and uses the color texture trees associated to the regions. Our recoloring method attempts to maintain the destination image's original value structure. This is accomplished by transferring only the # and # channels from the source. To make our method computationally tractable, we work within an image pyramid, transferring color layer by layer.
Hardware acceleration of divideandconquer paradigms: a case study
 Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines
, 1993
"... ..."
(Show Context)
Shortest paths routing in arbitrary networks
 JOURNAL OF ALGORITHMS
, 1999
"... We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bo ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We introduce an online protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in OC � Ž D � log N. steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for boundeddegree leveled networks. Further, we show that the preceding bound holds also for random routing problems with C denoting the maximum expected congestion over all links. Based on this result, we give applications for random routing in Cayley networks, general node symmetric networks, edge symmetric networks, and de Bruijn networks. Finally, we examine the problems arising when our approach is applied to routing along nonshortest paths, deterministic routing, or routing with bounded buffers.
How Branch Mispredictions Affect Quicksort
, 2006
"... We explain the counterintuitive observation that finding “good” pivots (close to the median of the array to be partitioned) may not improve performance of quicksort. Indeed, an intentionally skewed pivot improves performance. The reason is that while the instruction count decreases with the quality ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We explain the counterintuitive observation that finding “good” pivots (close to the median of the array to be partitioned) may not improve performance of quicksort. Indeed, an intentionally skewed pivot improves performance. The reason is that while the instruction count decreases with the quality of the pivot, the likelihood that the direction of a branch is mispredicted also goes up. We analyze the effect of simple branch prediction schemes and measure the effects on real hardware.
Polymorphic dynamic typing — aspects of proof theory and inference
, 1995
"... We study dynamic typing in continuation of Henglein’s dynamically typed λcalculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed λcalculus provides a formal framework within which we can reason in a precise manner about proper ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We study dynamic typing in continuation of Henglein’s dynamically typed λcalculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed λcalculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from raw programs by insertion of type coercions which model runtime type operations of tagging and checking/untagging. Central among the problems studied in dynamic typing are the notions of minimization of runtime type coercions in completions and safety of completions. From the monomorphic framework of Henglein’s system, we work towards a polymorphic generalization which eventually comprises HindleyMilner style polymorphism, discriminative, tagged sum types, regular recursive types and socalled coercive types with a notion of coercion parameterization. The resulting system can be seen as a form of polymorphic qualified type system which aims at a common generalization of dynamic typing and certain systems of soft typing.
Limit Theorems for Mergesort
 Random Structures Algorithms
, 1996
"... Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard topdown recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms and standard analytic methods in probabi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard topdown recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms and standard analytic methods in probability theory. 1