Sciweavers

250 search results - page 41 / 50
» Reorganizing compressed text
Sort
View
CAISE
2006
Springer
13 years 11 months ago
An Efficient Approach to Support Querying Secure Outsourced XML Information
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
Yin Yang, Wilfred Ng, Ho Lam Lau, James Cheng
ICIP
2002
IEEE
14 years 9 months ago
An image signature for any kind of image
We describe an algorithm for computing an image signature, suitable for first-stage screening for duplicate images. Our signature relies on relative brightness of image regions, a...
Chi Wong, Marshall W. Bern, David Goldberg
NLPRS
2001
Springer
13 years 12 months ago
Modality Expressions in Japanese and Their Automatic Paraphrasing
It is important for future NLP systems to formulate the semantic equivalence (and more generally, the semantic similarity) of natural language expressions. In particular, paraphra...
Toshifumi Tanabe, Kenji Yoshimura, Kosho Shudo
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 11 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
CLA
2004
13 years 8 months ago
Concept Lattice Generation by Singular Value Decomposition
Abstract. Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating c...
Petr Gajdos, Pavel Moravec, Václav Sn&aacut...