Sciweavers

21324 search results - page 261 / 4265
» Making the case for computing
Sort
View
ECCC
2008
122views more  ECCC 2008»
15 years 4 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira

Book
391views
17 years 2 months ago
Build a Computer from Scratch
"In this article series you will be shown how to build a computer system. This article series will cover how to select and install everything such as the case, motherboard, vi...
Jeff Heaton
FPL
2006
Springer
94views Hardware» more  FPL 2006»
15 years 7 months ago
Sizing of Processing Arrays for FPGA-Based Computation
Computing applications in FPGAs are commonly built from repetitive structures of computing and/or memory elements. In many cases, application performance depends on the degree of ...
Tom Van Court, Martin C. Herbordt
CCGRID
2004
IEEE
15 years 8 months ago
Learning Grid technologies in a project-based computer architecture course
This paper describes the integration of the grid topic within a Computer Architecture engineering course. Students are engaged in a project of design and evaluation of computing s...
Guillermo Vega-Gorgojo, Yannis A. Dimitriadis, Edu...
140
Voted
STOC
2001
ACM
143views Algorithms» more  STOC 2001»
16 years 4 months ago
Computing crossing numbers in quadratic time
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
Martin Grohe