96 search results - page 3 / 20 » Efficient Mapping of Addition Recurrence Algorithms in CMOS |
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
ECCV
2004
Springer
14 years 8 months ago
2004
Springer
This paper presents a biologically motivated model for low and mid-level vision tasks and its interpretation in computer vision terms. Initially we briefly present the biologically...
WSCG
2003
13 years 8 months ago
2003
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
BMCBI
2002
13 years 6 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...