Sciweavers

11016 search results - page 509 / 2204
» Cloud Computing for Science
Sort
View
WG
2010
Springer
15 years 5 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
SIGCSE
2009
ACM
135views Education» more  SIGCSE 2009»
16 years 7 months ago
Breadth-last technical electives: integrating the CS core via computer games and mobile robotics
In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curricu...
William W. White, Jerry B. Weinberg
IJCNN
2007
IEEE
16 years 1 months ago
Self-Organizing Maps as Traveling Computational Templates
In this article we approach neural networks as computational templates that travel across various sciences. Traditionally, it has been thought that models are primarily models of s...
Tarja Knuuttila, Anna-Mari Rusanen, Timo Honkela
ISVD
2007
IEEE
16 years 1 months ago
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
Guodong Rong, Tiow Seng Tan
FOCS
2006
IEEE
16 years 1 months ago
New Limits on Fault-Tolerant Quantum Computation
We show that quantum circuits cannot be made faulttolerant against a depolarizing noise level of ˆθ = (6 − 2 √ 2)/7 ≈ 45%, thereby improving on a previous bound of 50% (du...
Harry Buhrman, Richard Cleve, Monique Laurent, Noa...