68 search results - page 12 / 14 » Structured Low Rank Approximation of a Bezout Matrix |
122
click to vote
CCCG
2010
15 years 4 months ago
2010
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
130
click to vote
JCNS
2010
14 years 10 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
124
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Latent Semantic Indexing (LSI) is a well established and effective framework for conceptual information retrieval. In traditional implementations of LSI the semantic structure of...
143
Voted
STACS
2007
Springer
15 years 9 months 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 ...
179
Voted
ICCV
2011
IEEE
14 years 3 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...