Complexity arises because detection requires the accurate localization of objects, creating two primary challenges. First, numerous candidate object locations (often called “proposals”) must be processed. Second, these candidates provide only rough localization that must be refined to achieve precise localization. Solutions to these problems often compromise speed, accuracy, or simplicity. In this paper, we propose … Continue reading Fast R-CNN
Problem description: Design an algorithm for computing the LCA of two nodes in a binary tree. The algorithm’s time complexity should depend only on the distance from the nodes to the LCA. Hint: Focus on the extreme case described in the problem introduction.
Problem description: Create a cache for looking up prices of books identified by their ISBN. You implement support lookup, insert, and remove methods. Use the Least Recently Used (LRU) policy for cache eviction. If an ISBN si already present, insert should not change the price, but it should update the entry to be the most … Continue reading 13.4 IMPLEMENT AN ISBN CACHE
Problem description: Write a program which takes text for an anonymous letter and in the character set the number of times and determines if it is possible to write the anonymous letter using the magazine. The anonymous letter can be written using the magazine if for each character in the anonymous letter, the number of … Continue reading 13.3 IS AN ANONYMOUS LETTER CONSTRUCTIBLE?
14.4 REMOVE FIRST-NAME DUPLICATES Reference 14.5 RENDER A CALENDAR Consider the problem of designing an online calendaring application. One component of the design is to render the calendar, i.e., display it visually. Suppose each day consists of a number of events, where an event is specified as a start time and a finish time. Individual … Continue reading 14. Sorting