2262 search results - page 370 / 453 » Points with large quadrant-depth |
SIAMCOMP
1998
14 years 11 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
111
click to vote
WWW
2003
ACM
16 years 17 days ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
MOBICOM
2004
ACM
15 years 5 months ago
2004
ACM
Wireless Local Area Networks (WLANs) are now commonplace on many academic and corporate campuses. As “Wi-Fi” technology becomes ubiquitous, it is increasingly important to und...
101
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
– When implementing public key security ser- easy for an adversary to collect data and attack. To solve this vices in mobile ad hoc networks (MANETs), multiple problem, the distr...
190
click to vote
Book
"The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, i...