2403 search results - page 105 / 481 » Optimal Randomized RANSAC |
129
click to vote
ALT
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
154
click to vote
TSMC
2010
14 years 10 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
107
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
125
click to vote
ASPDAC
2009
ACM
15 years 9 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
134
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...