Sciweavers

2913 search results - page 186 / 583
» How Much to Copy
Sort
View
JBI
2006
107views Bioinformatics» more  JBI 2006»
15 years 20 days ago
KDE Bioscience: Platform for bioinformatics analysis workflows
Bioinformatics is a dynamic research area in which a large number of algorithms and programs have been developed rapidly and independently without much consideration so far of the...
Qiang Lu, Pei Hao, Vasa Curcin, Wei-Zhong He, Yuan...
108
Voted
TCBB
2008
101views more  TCBB 2008»
15 years 18 days ago
Improved Layout of Phylogenetic Networks
Split networks are increasingly being used in phylogenetic analysis. Usually, a simple equal-angle algorithm is used to draw such networks, producing layouts that leave much room f...
Philippe Gambette, Daniel H. Huson
71
Voted
TPDS
2008
74views more  TPDS 2008»
15 years 17 days ago
NRMI: Natural and Efficient Middleware
We present NRMI: a drop-in replacement for Java RMI that supports call-by-copy-restore semantics for arbitrary linked data structures, in addition to regular call-by-copy semantic...
Eli Tilevich, Yannis Smaragdakis
100
Voted
CONNECTION
2004
92views more  CONNECTION 2004»
15 years 16 days ago
High capacity associative memories and connection constraints
: High capacity associative neural networks can be built from networks of perceptrons, trained using simple perceptron training. Such networks perform much better than those traine...
Neil Davey, Rod Adams
103
Voted
CORR
2004
Springer
93views Education» more  CORR 2004»
15 years 16 days ago
Maximum Mutual Information of Space-Time Block Codes with Symbolwise Decodability
In this paper, we analyze the performance of space-time block codes which enable symbolwise maximum likelihood decoding. We derive an upper bound of maximum mutual information (MM...
Kenji Tanaka 0003, Ryutaroh Matsumoto, Tomohiko Uy...