Sciweavers

1778 search results - page 331 / 356
» On the Power of the Randomized Iterate
Sort
View
ICISC
2000
126views Cryptology» more  ICISC 2000»
14 years 11 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
91
Voted
AAAI
1996
14 years 11 months ago
What Is Planning in the Presence of Sensing?
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
Hector J. Levesque
ICIP
2007
IEEE
14 years 9 months ago
Information-Based Color Feature Representation for Image Classification
1 For the image classification task, the color histogram is widely used as an important color feature indicating the content of the image. However, the high-resolution color histog...
Shi-Lin Wang, Alan Wee-Chung Liew
BMCBI
2010
163views more  BMCBI 2010»
14 years 9 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek
CORR
2008
Springer
185views Education» more  CORR 2008»
14 years 9 months ago
Realizing Fast, Scalable and Reliable Scientific Computations in Grid Environments
The practical realization of managing and executing large scale scientific computations efficiently and reliably is quite challenging. Scientific computations often invo...
Yong Zhao, Ioan Raicu, Ian T. Foster, Mihael Hateg...