Sciweavers

19866 search results - page 254 / 3974
» Computing all factorizations in ***
Sort
View
DAGSTUHL
2007
15 years 8 months ago
An Inner/Outer Stationary Iteration for Computing PageRank
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
Andrew P. Gray, Chen Greif, Tracy Lau
ASSETS
2010
ACM
15 years 6 months ago
Blind guidance using mobile computer vision: a usability study
We present a study focusing on the usability of a wayfinding and localization system for persons with visual impairment. This system uses special color markers, placed at key loca...
Roberto Manduchi, Sri Kurniawan, Homayoun Bagherin...
IJCV
2006
115views more  IJCV 2006»
15 years 6 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
SYNTHESE
2008
88views more  SYNTHESE 2008»
15 years 6 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 6 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman