Sciweavers

1173 search results - page 197 / 235
» Ranking functions and rankings on languages
Sort
View
FSTTCS
2007
Springer
14 years 1 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
PDP
2006
IEEE
14 years 1 months ago
An Experimental Validation of the PRO Model for Parallel and Distributed Computation
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
Mohamed Essaïdi, Jens Gustedt
CVPR
2010
IEEE
14 years 1 months ago
Secrets of Optical Flow Estimation and Their Principles
The accuracy of optical flow estimation algorithms has been improving steadily as evidenced by results on the Middlebury optical flow benchmark. The typical formulation, however...
Deqing Sun, Stefan Roth, Michael Black
AIRS
2005
Springer
14 years 1 months ago
Query Expansion with the Minimum Relevance Judgments
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
Masayuki Okabe, Kyoji Umemura, Seiji Yamada