Sciweavers

19320 search results - page 3803 / 3864
» On the complexity of computing determinants
Sort
View
FC
2008
Springer
90views Cryptology» more  FC 2008»
14 years 11 months ago
Practical Anonymous Divisible E-Cash from Bounded Accumulators
We present an efficient off-line divisible e-cash scheme which is truly anonymous without a trusted third party. This is the second scheme in the literature which achieves full unl...
Man Ho Au, Willy Susilo, Yi Mu
APVIS
2007
14 years 11 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
BIOCOMP
2007
14 years 11 months ago
Prediction of trans-antisense Transcripts in Arabidopsis thaliana
Background: Natural antisense transcripts (NATs) are coding or non-coding RNAs with sequence complementarity to other transcripts (sense transcripts). These RNAs could potentially...
Huan Wang, Nam-Hai Chua, Xiu-Jie Wang
CCE
2007
14 years 11 months ago
A Web Services based Approach for System on a Chip Design Planning
: The concept of Virtual Organisation (VO) offers various solutions to management, collaboration and coordination issues important for distributed collaborating teams. Deployment o...
Maciej Witczynski, Edward Hrynkiewicz, Adam Pawlak
ECIR
2010
Springer
14 years 11 months ago
Improving Retrievability of Patents in Prior-Art Search
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
Shariq Bashir, Andreas Rauber
« Prev « First page 3803 / 3864 Last » Next »