Sciweavers

491 search results - page 7 / 99
» Avoiding Determinization
Sort
View
COMBINATORICS
1998
113views more  COMBINATORICS 1998»
13 years 7 months ago
A Multivariate Lagrange Inversion Formula for Asymptotic Calculations
The determinant that is present in traditional formulations of multivariate Lagrange inversion causes difficulties when one attempts to obtain asymptotic information. We obtain an...
Edward A. Bender, L. Bruce Richmond

Publication
182views
15 years 5 months ago
The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks
We propose an explicit rate indication scheme for congestion avoidance in ATM networks. In this scheme, the network switches monitor their load on each link, determining a load fac...
Shivkumar Kalyanaraman, Raj Jain, Sonia Fahmy, Roh...
ICCV
2005
IEEE
14 years 9 months ago
Improved Sub-pixel Stereo Correspondences through Symmetric Refinement
Most dense stereo correspondence algorithms start by establishing discrete pixel matches and later refine these matches to sub-pixel precision. Traditional sub-pixel refinement me...
Diego Nehab, Szymon Rusinkiewicz, James Davis
ICALP
2004
Springer
14 years 24 days ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
EJC
2008
13 years 7 months ago
Pattern classes of permutations via bijections between linearly ordered sets
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
Sophie Huczynska, Nikola Ruskuc