Learn More
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to efficiently process graph queries. Querying graph databases is costly since it involves <i>subgraph isomorphism</i> testing, which is an <i>NP-complete</i> problem. In recent years,(More)
Insect species recognition is more difficult than generic object recognition because of the similarity between different species. In this paper, we propose a hybrid approach called discriminative local soft coding (DLSoft) which combines local and discriminative coding strategies together. Our method takes use of neighbor codewords to get a local soft(More)
In the real world there are vaguely specified data values in many applications, such as sensor information. Fuzzy set theory has been proposed to handle such vagueness by generalizing the notion of membership in a set. Essentially, in a Fuzzy Set (FS) each element is associated with a point-value selected from the unit interval [0,1], which is termed the(More)
A radio-frequency identification (RFID) system including hardware and software may be updated from time to time after first time deployment. To ensure the reliability of the system, extensive tests are required. However, enumerating all test cases is infeasible, especially when the tests involve time-consuming hardware operations. To solve this problem, we(More)
Several techniques exist to automatically synthesize a 2D image resembling an input exemplar texture. Most of the approaches optimize a new image so that the color neighborhoods in the output closely match those in the input, across all scales. In this paper we revisit by-example texture synthesis in the context of additive manufacturing. Our goal is to(More)
Vague information is common in many database applications due to intensive data dissemination arising from different pervasive computing sources, such as the high volume data obtained from sensor networks and mobile communications. In this paper, we utilize functional dependencies (FDs) and inclusion dependencies (INDs), which are the most fundamental(More)