We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Abstract— Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With ”Rollin’ Justin” a mobile robotic system...
We present a new approach to robust pose-variant face
recognition, which exhibits excellent generalization ability
even across completely different datasets due to its weak
depe...
John Wright (University of Illinois), Gang Hua (Mi...