844 search results - page 149 / 169 » Semantic Analysis of Matrix Structures |
161
Voted
QEST
2008
IEEE
16 years 25 days ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
179
click to vote
STACS
2007
Springer
16 years 16 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
167
Voted
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
197
Voted
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
202
Voted
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
The field of human-computer interaction has been widely investigated in the last years, resulting in a variety of systems used in different application fields like virtual reality...