Sciweavers

10146 search results - page 164 / 2030
» Fast FAST
Sort
View
112
Voted
DM
2006
91views more  DM 2006»
15 years 3 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
134
Voted
ITIIS
2008
110views more  ITIIS 2008»
15 years 3 months ago
Fast Detection of Distributed Global Scale Network Attack Symptoms and Patterns in High-speed Backbone Networks
Traditional attack detection schemes based on packets or flows have very high computational complexity. And, network based anomaly detection schemes can reduce the complexity, but...
Sun Ho Kim, Byeong-hee Roh
124
Voted
JCC
2008
92views more  JCC 2008»
15 years 3 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick
145
Voted
INFORMATICALT
2006
134views more  INFORMATICALT 2006»
15 years 3 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
Very fast watermarking by reversible contrast mapping
—Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits...
Dinu Coltuc, Jean-Marc Chassery