7758 search results - page 358 / 1552 » On the Number of Distributive Lattices |
186
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
171
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
172
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
169
click to vote
MICCAI
2002
Springer
16 years 7 months ago
2002
Springer
Non-rigid registration requires a smoothness or regularization term for making the warp field regular. Standard models in use here include b-splines and thin plate splines. In thi...
170
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...