251 search results - page 12 / 51 » When Size Does Matter |
SIAMDM
2008
13 years 7 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper presents an algorithm which can effectively constrain inertial navigation drift using monocular camera data. It is capable of operating in unknown and large ...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
ALGORITHMICA
2008
13 years 7 months ago
2008
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...