1439 search results - page 92 / 288 » Fast approximation of centrality |
92
Voted
MJ
2006
15 years 21 days ago
2006
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
94
Voted
COMGEO
1999
ACM
15 years 12 days ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
147
click to vote
JMIV
2008
15 years 7 days ago
2008
In this paper, we propose a global method for estimating the motion of a camera which films a static scene. Our approach is direct, fast and robust, and deals with adjacent frames...
117
Voted
TOG
2010
14 years 7 months ago
2010
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
83
Voted
ICCBR
2005
Springer
15 years 6 months ago
2005
Springer
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...