Sciweavers

1186 search results - page 207 / 238
» Improving Random Walk Performance
Sort
View
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 5 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
CVPR
2012
IEEE
12 years 9 days ago
Augmenting deformable part models with irregular-shaped object patches
The performance of part-based object detectors generally degrades for highly flexible objects. The limited topological structure of models and pre-specified part shapes are two ...
Roozbeh Mottaghi
ISPA
2005
Springer
14 years 3 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
P2P
2008
IEEE
124views Communications» more  P2P 2008»
14 years 4 months ago
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at th...
Ana Paula Couto da Silva, Emilio Leonardi, Marco M...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci