Sciweavers

1143 search results - page 101 / 229
» pairing 2007
Sort
View
NETWORKING
2000
13 years 11 months ago
Computing Blocking Probabilities in Multi-class Wavelength Routing Networks
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
Sridhar Ramesh, George N. Rouskas, Harry G. Perros
IJCAI
1997
13 years 11 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
ACL
1996
13 years 11 months ago
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniqu...
Michael Collins
GRAPHICSINTERFACE
1996
13 years 11 months ago
Topological Evolution of Surfaces
This paper presents a framework for generating smoothlooking transformations between pairs of surfaces that may differ in topology. The user controls the transformation by specify...
Douglas DeCarlo, Jean H. Gallier
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 11 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot