Sciweavers

208 search results - page 19 / 42
» Optimal SINR-based Random Access
Sort
View
BMCBI
2008
142views more  BMCBI 2008»
15 years 5 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
TPDS
2002
136views more  TPDS 2002»
15 years 5 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
EDBT
2004
ACM
131views Database» more  EDBT 2004»
16 years 5 months ago
Declustering Two-Dimensional Datasets over MEMS-Based Storage
Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than mu...
Hailing Yu, Divyakant Agrawal, Amr El Abbadi
155
Voted
ITIIS
2010
158views more  ITIIS 2010»
15 years 8 days ago
Development of a Dynamic Collision Avoidance Algorithm for Indoor Tracking System Based on Active RFID
We propose a novel collision-avoidance algorithm for the active type RFID regarding an indoor tracking system. Several well-known collision avoidance algorithms are analyzed consi...
Sekyung Han, Yeonsuk Choi, Masayuki Iwai, Kaoru Se...
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}â...
Ueli M. Maurer, Stefano Tessaro