Sciweavers

1656 search results - page 93 / 332
» Labeling Schemes with Queries
Sort
View
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 9 months ago
The Tree Inclusion Problem: In Linear Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
Philip Bille, Inge Li Gørtz
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 2 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 9 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
VTC
2007
IEEE
142views Communications» more  VTC 2007»
14 years 3 months ago
Iterative Demodulation and Decoding for Rotated MPSK Constellations with Convolutional Coding and Signal Space Diversity
— Signal space diversity (SSD) with the rotation of the signal constellation using multi-level modulation schemes is known to provide good performance gains over fading channels....
Nauman F. Kiyani, Jos H. Weber
IJNSEC
2006
132views more  IJNSEC 2006»
13 years 9 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma