6110 search results - page 387 / 1222 » Approximate Computing |
172
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
203
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
191
click to vote
FTDB
2011
14 years 10 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
131
click to vote
COMPUTING
2006
15 years 6 months ago
2006
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...
296
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...