Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
The problem of passive localization is commonly solved by independently measuring intermediate parameters (such as angles of arrival (AOA), times of arrival (TOA)...) on several m...
Fusing partial estimates is a critical and common problem
in many computer vision tasks such as part-based detection
and tracking. It generally becomes complicated and
intractab...
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...