1068 search results - page 95 / 214 » Fast and robust bootstrap |
154
Voted
WINET
2010
14 years 10 months ago
2010
With the technical advances in ubiquitous computing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figu...
91
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
119
click to vote
ICDAR
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, a new method for document images or photos binarization is presented. The method is simple, fast and robust and appropriate for normal as well as for special cases ...
128
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
120
Voted
NAACL
2003
15 years 5 months ago
2003
Large-scale parsing is still a complex and timeconsuming process, often so much that it is infeasible in real-world applications. The parsing system described here addresses this ...