6299 search results - page 111 / 1260 » Data and Computation Abstractions for Dynamic and Irregular ... |
189
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
177
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Trusted Collaborative Computing (TCC) is a new research and application paradigm. Two important challenges in such a context are represented by secure information transmission a...
355
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
181
click to vote
ICCS
2007
Springer
16 years 1 months ago
2007
Springer
The Louisiana Coastal Area presents an array of rich and urgent scientific problems that require new computational approaches. These problems are interconnected with common compon...
181
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...