3172 search results - page 63 / 635 » On the Random-Self-Reducibility of Complete Sets |
101
click to vote
TARK
2007
Springer
15 years 6 months ago
2007
Springer
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
97
Voted
WRLA
2010
14 years 11 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
104
Voted
PATAT
2000
Springer
15 years 4 months ago
2000
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
116
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
106
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...