Sciweavers

11345 search results - page 248 / 2269

» Foundations of Computer Science

116

CSE
2010
IEEE

130views Theoretical Computer Science» more CSE 2010»

Ch MPI: Interpretive Parallel Computing in C

15 years 6 months ago

Ch MPI: Interpretive Parallel Computing in C

Download iel.ucdavis.edu

Yu-Cheng Chou, Stephen S. Nestinger, Harry H. Chen...

claim paper

Read More »

123

CSE
2008
IEEE

113views Theoretical Computer Science» more CSE 2008»

Computing Models for FPGA-Based Accelerators

15 years 6 months ago

Computing Models for FPGA-Based Accelerators

Download www.bu.edu

Martin C. Herbordt, Yongfeng Gu, Tom Van Court, Jo...

claim paper

Read More »

129

CSE
2008
IEEE

87views Theoretical Computer Science» more CSE 2008»

Measuring High-Performance Computing with Real Applications

15 years 6 months ago

Measuring High-Performance Computing with Real Applications

Download cobweb.ecn.purdue.edu

Mohamed Sayeed, Hansang Bae, Yili Zheng, Brian Arm...

claim paper

Read More »

97

CSE
2007
IEEE

63views Theoretical Computer Science» more CSE 2007»

Stochastic Computational Fluid Mechanics

15 years 6 months ago

Stochastic Computational Fluid Mechanics

Download www.cfm.brown.edu

Guang Lin, Xiaoliang Wan, Chau-Hsing Su, George E....

claim paper

Read More »

171

CORR
2010
Springer

90views Education» more CORR 2010»

Logical complexity of graphs: a survey

15 years 6 months ago

Logical complexity of graphs: a survey

Download www.cs.technion.ac.il

We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...

Oleg Pikhurko, Oleg Verbitsky

claim paper

Read More »

« Prev « First page 248 / 2269 Last » Next »