1369 search results - page 143 / 274 » Lattice computations for random numbers |
161
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
158
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
166
click to vote
AINA
2007
IEEE
16 years 2 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
145
click to vote
ACSC
2006
IEEE
15 years 11 months ago
2006
IEEE
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
139
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...