Sciweavers

3670 search results - page 347 / 734
» Linear Recursive Functions
Sort
View
COMPLEXITY
2004
69views more  COMPLEXITY 2004»
15 years 6 months ago
Mathematical models for explaining the emergence of specialization in performing tasks
In an evolving community consisting of many individuals, it is often the case that the individuals tend, over time, to become more specialized in performing the tasks necessary fo...
Daniel Solow, Joesph Szmerekovsky
FOCM
2002
97views more  FOCM 2002»
15 years 6 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 6 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
PAMI
1998
116views more  PAMI 1998»
15 years 6 months ago
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
—Because of image sampling, traditional measures of pixel dissimilarity can assign a large value to two corresponding pixels in a stereo pair, even in the absence of noise and ot...
Stan Birchfield, Carlo Tomasi
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...