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...
Alberto Bertoni, Christian Choffrut, Massimiliano ...
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...
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...
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 ...
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...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...