2168 search results - page 290 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
150
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Protein sequences with unknown functionality are often compared to a set of known sequences to detect functional similarities. Efficient dynamic programming algorithms exist for t...
148
click to vote
HUC
2009
Springer
15 years 8 months ago
2009
Springer
To usefully query a location-based service, a mobile device must typically present its own location in its query to the server. This may not be acceptable to clients that wish to ...
122
click to vote
TOMS
2011
14 years 11 months ago
2011
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
134
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
171
click to vote
MOBISYS
2009
ACM
16 years 4 months ago
2009
ACM
We design, implement, and evaluate a vehicular communication system that improves uplink connectivity through multi-lobe beam pattern switching on a smart antenna. Directionality ...