1716 search results - page 256 / 344 » Proving Conditional Termination |
118
click to vote
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
138
click to vote
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
112
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Leveraging research by psychologists on human decision-making, we present a human-robot decision-making problem associated with a complex task and study the corresponding joint...
138
Voted
CISS
2008
IEEE
15 years 9 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
166
click to vote
CVPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Linear and multi-linear models of object shape/appearance (PCA, 3DMM, AAM/ASM, multilinear tensors) have been very popular in computer vision. In this paper, we analyze the validi...