2621 search results - page 124 / 525 » Near orders and codes |
133
Voted
MOBICOM
1998
ACM
15 years 9 months ago
1998
ACM
CT In order to support location-aware applications it is necessary to locate people and equipment in near real-time. To avoid unnecessary exposure of details of the underlying trac...
144
click to vote
MA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract − We address the estimation of quantiles from heavy-tailed distributions when functional covariate information is available and in the case where the order of the quanti...
131
click to vote
TVCG
2010
15 years 3 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
196
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
In this work, we propose a contour and region detector for video data that exploits motion cues and distinguishes occlusion boundaries from internal boundaries based on optical ï¬...
126
click to vote
VLSISP
2010
14 years 11 months ago
2010
We propose a new parallelization scheme for the hmmsearch function of the HMMER software, in order to target FPGA technology. hmmsearch is a very compute intensive software for bio...