Results 1 - 4 of 4

Searching Keywords with Wildcards on Encrypted Data

by Saeed Sedghi, Peter Van Liesdonk, Svetla Nikova, Pieter Hartel, Willem Jonker
"... Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption key is also derived from such a vector, but this one is also allowed to have “⋆ ” (or wildcard) entries. Decryption is pos ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
length is equally shorter than existing schemes, depending on a trade-off. The length of the decryption key and the computational complexity of decryption are both constant, unlike existing schemes where these are both dependent on the amount of non-wildcard symbols associated to the decryption key. Our

Performance Comparison of Ten Variations on the Interpretation-Tree Matching Algorithm

by Robert Fisher - In ECCV94 , 1994
"... . The best known algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines ten variations of this algorithm in a search ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
search for improved performance, and concludes that the non-wildcard and hierarchical algorithms have reduced theoretical complexity and run faster than the standard algorithm. 1 Introduction The most well-known algorithm for symbolic model matching in computer vision is the Interpretation Tree (IT

J.S.: Space-efficient string indexing for wildcard pattern matching

by Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter - In: STACS , 2014
"... In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses O(n logε n) bits for any ε> 0 and reports all occ occurrences of a wildcard string in O(m + σg · µ(n) + occ) time, where µ(n) = o(lo ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
(log log logn), σ is the alphabet size, m is the number of alphabet symbols and g is the number of wildcard symbols in the query string. We also present an O(n)-bit index with O((m + σg + occ) logε n) query time and an O(n(log logn)2)-bit index with O((m+ σg + occ) log logn) query time. These are the first

Correct high-level synthesis: a formal perspective

by J M Mendías , R Hermida , M Fernández - In Design, Automation and Test in Europe , 1998
"... Abstract This paper presents a form al sy nthesis sy stem w hich delegates the design space ex ploration to non-form al, and potentially incorrect, high lev el sy nthesis tools. W ith a quadratic com plex ity, our sy stem obtains either a truly correct-by -construction design, since the form al des ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
will use the symbol # (wildcard) to represent those values computed but not stored in certain cycle (i.e. calculated by a resource which no operation has been assigned to). And, finally, we will introduce the nex t operator as the inverse of fby. As an example, let index = <1,2,3,4...> be an stream
Results 1 - 4 of 4