Sciweavers

23988 search results - page 4567 / 4798
» Social Network Computing
Sort
View
CSB
2004
IEEE
141views Bioinformatics» more  CSB 2004»
15 years 8 months ago
MinPD: Distance-Based Phylogenetic Analysis and Recombination Detection of Serially-Sampled HIV Quasispecies
A new computational method to study within-host viral evolution is explored to better understand the evolution and pathogenesis of viruses. Traditional phylogenetic tree methods a...
Patricia Buendia, Giri Narasimhan
CIKM
2006
Springer
15 years 8 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
CODES
2006
IEEE
15 years 8 months ago
Automatic phase detection for stochastic on-chip traffic generation
During System on Chip (SoC) design, Network on Chip (NoC) prototyping is used for adapting NoC parameters to the application running on the chip. This prototyping is currently don...
Antoine Scherrer, Antoine Fraboulet, Tanguy Risset
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 8 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
« Prev « First page 4567 / 4798 Last » Next »