774 search results - page 58 / 155 » A subdivision-based algorithm for the sparse resultant |
130
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
156
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract--A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on ...
105
click to vote
CIMAGING
2010
15 years 2 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...