Sciweavers

612 search results - page 35 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
14 years 1 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
CANDC
2009
ACM
13 years 11 months ago
Computational and cognitive infrastructures of stigma: empowering identity in social computing and gaming
Computing technologies such as games, social networking sites, and virtual environments often reproduce forms of social stigma encountered in everyday real life, as well as introd...
D. Fox Harrell
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
On the fourier tails of bounded functions over the discrete cube
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
ACMSE
2007
ACM
13 years 11 months ago
Integrating BlackBerry wireless devices into computer programming and literacy courses
In this paper we describe our experience in integrating the RIM's BlackBerry handheld wireless device into programming and literacy courses at the University of Guelph and th...
Qusay H. Mahmoud, Allan Dyer
CCS
2008
ACM
13 years 9 months ago
SNAPP: stateless network-authenticated path pinning
This paper examines a new building block for next-generation networks: SNAPP, or Stateless Network-Authenticated Path Pinning. SNAPP-enabled routers securely embed their routing d...
Bryan Parno, Adrian Perrig, Dave Andersen