Sciweavers

3130 search results - page 96 / 626
» Collusion without communication
Sort
View
CONIELECOMP
2005
IEEE
16 years 18 hour ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
ISMVL
2005
IEEE
86views Hardware» more  ISMVL 2005»
15 years 12 months ago
Multiple-Valued Duplex Asynchronous Data Transfer Scheme for Interleaving in LDPC Decoders
A novel duplex asynchronous data-transfer scheme based on multiple-valued encoding is proposed for interleaving in Low-Density Parity-Check (LDPC) decoders, where high-throughput ...
Naoya Onizawa, Akira Mochizuki, Takahiro Hanyu
FC
2005
Springer
109views Cryptology» more  FC 2005»
15 years 12 months ago
Fraud Within Asymmetric Multi-hop Cellular Networks
At Financial Cryptography 2003, Jakobsson, Hubaux, and Butty´an suggested a lightweight micro-payment scheme aimed at encouraging routing collaboration in asymmetric multi-hop cel...
Gildas Avoine
GLOBECOM
2007
IEEE
15 years 10 months ago
Resource Efficient Survivable Clustering for Wireless Sensor Networks
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
Mohammad Masud Hasan, Jason P. Jue
CN
2007
124views more  CN 2007»
15 years 6 months ago
Cryptographic techniques for mobile ad-hoc networks
In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New ...
Vanesa Daza, Javier Herranz, Paz Morillo, Carla R&...