Sciweavers

1814 search results - page 362 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
103
Voted
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,...
EUROPAR
2010
Springer
14 years 10 months ago
Optimized Dense Matrix Multiplication on a Many-Core Architecture
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
Elkin Garcia, Ioannis E. Venetis, Rishi Khan, Guan...
BMCBI
2010
183views more  BMCBI 2010»
14 years 9 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
BMCBI
2010
122views more  BMCBI 2010»
14 years 9 months ago
Ovarian cancer classification based on dimensionality reduction for SELDI-TOF data
Background: Recent advances in proteomics technologies such as SELDI-TOF mass spectrometry has shown promise in the detection of early stage cancers. However, dimensionality reduc...
Kai-Lin Tang, Tong-Hua Li, Wen-Wei Xiong, Kai Chen
73
Voted
BMCBI
2008
97views more  BMCBI 2008»
14 years 9 months ago
Interrogating domain-domain interactions with parsimony based approaches
Background: The identification and characterization of interacting domain pairs is an important step towards understanding protein interactions. In the last few years, several met...
Katia S. Guimarães, Teresa M. Przytycka