2168 search results - page 140 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
158
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
127
click to vote
TVLSI
2008
15 years 3 months ago
2008
Recently, it has become possible to implement floating-point cores on field-programmable gate arrays (FPGAs) to provide acceleration for the myriad applications that require high-p...
191
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
A fast collision detection and resolution scheme is one of the key components for interactive simulation of deformable objects. It is particularly challenging to reduce the computa...
130
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
125
click to vote
PAMI
2008
15 years 4 months ago
2008
The aim of this paper is to achieve seamless image stitching without producing visual artifact caused by severe intensity discrepancy and structure misalignment, given that the inp...