Search Sciweavers | Sciweavers

26

TC
2008

109views Information Technology» more TC 2008»

Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials

13 years 9 months ago

$Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials$

In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...

Francisco Rodríguez-Henríquez, Guill...

claim paper

Read More »

48

click to vote

TNN
2008

152views more TNN 2008»

Distributed Parallel Support Vector Machines in Strongly Connected Networks

13 years 9 months ago

Download yumaolu.com

We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...

Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe

claim paper

Read More »

21

click to vote

ISCI
1998

82views more ISCI 1998»

The ParaStation Project: Using Workstations as Building Blocks for Parallel Computing

13 years 9 months ago

Download eref.uqu.edu.sa

The ParaStation communication fabric provides a high-speed communicationnetwork with user-levelaccess to enable e cientparallel computing on workstation clusters. The architecture...

Thomas M. Warschko, Joachim M. Blum, Walter F. Tic...

claim paper

Read More »

43

click to vote

SAC
2011
ACM

185views Applied Computing» more SAC 2011»

Parallel multivariate slice sampling

13 years 14 days ago

Download www.stat.psu.edu

Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...

Matthew M. Tibbits, Murali Haran, John C. Liechty

claim paper

Read More »

32

click to vote

CCECE
2006
IEEE

151views Electrical And Computer Engi...» more CCECE 2006»

Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction

14 years 3 months ago

Download integra.cs.wayne.edu

Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...

Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers