6045 search results - page 922 / 1209 » Computable Linearizations of Well-partial-orderings |
169
click to vote
TIT
2008
15 years 6 months ago
2008
Abstract. Quaternary Z RM (r,m) codes were defined to study the Z4-linearity of ReedMuller codes. In the literature two different definitions of such codes can be found, denoted Z ...
232
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
187
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
169
Voted
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
211
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We propose a new approach for face recognition under arbitrary illumination conditions, which requires only one training image per subject (if there is no pose variation) and no 3...