Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
Over the last decades fiducial markers have provided widely adopted tools to add reliable model-based features into an otherwise general scene. Given their central role in many c...
Filippo Bergamasco, Andrea Albarelli, Andrea Torse...
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
Xiaobai Liu, Liang Lin, Shuicheng Yan, Hai Jin, We...
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...