Sciweavers

1695 search results - page 119 / 339
» Linear, Polynomial or Exponential
Sort
View
COLOGNETWENTE
2010
15 years 3 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
IANDC
2010
79views more  IANDC 2010»
15 years 3 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
WINE
2010
Springer
159views Economy» more  WINE 2010»
15 years 2 months ago
Local Dynamics in Bargaining Networks via Random-Turn Games
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
L. Elisa Celis, Nikhil R. Devanur, Yuval Peres
ARITH
2005
IEEE
15 years 10 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
CVPR
2007
IEEE
16 years 6 months ago
Efficient Belief Propagation for Vision Using Linear Constraint Nodes
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
Brian Potetz