2038 search results - page 2 / 408 » Improvements to the Psi-SSA representation |
ESOP
2000
Springer
13 years 8 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
ACL
2006
13 years 6 months ago
2006
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
AAAI
2006
13 years 6 months ago
2006
Planning in partially-observable dynamical systems is a challenging problem, and recent developments in point-based techniques such as Perseus significantly improve performance as...
ETS
2010
IEEE
13 years 6 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...