749 search results - page 28 / 150 » Scenario based Analysis of Linear Computations |
IMA
1995
Springer
15 years 5 months ago
1995
Springer
An algorithm for finding small-weight words in large linear codes is developed and a precise analysis of its complexity is given. It is in particular able to decode random [512,256...
TOG
2002
15 years 1 months ago
2002
Geometric transformations are most commonly represented as square matrices in computer graphics. Following simple geometric arguments we derive a natural and geometrically meaning...
144
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
140
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
111
click to vote
ICMI
2005
Springer
15 years 7 months ago
2005
Springer
Untethered multimodal interfaces are more attractive than tethered ones because they are more natural and expressive for interaction. Such interfaces usually require robust vision...