Sciweavers

218 search results - page 22 / 44
» Convexity-based algorithms for design centering
Sort
View
SIGCSE
2004
ACM
188views Education» more  SIGCSE 2004»
14 years 1 months ago
Buffer pools and file processing projects for an undergraduate data structures course
This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access i...
Clifford A. Shaffer
POPL
2012
ACM
12 years 3 months ago
A compiler and run-time system for network programming languages
Software-defined networks (SDNs) are a new implementation architecture in which a controller machine manages a distributed collection of switches, by instructing them to install ...
Christopher Monsanto, Nate Foster, Rob Harrison, D...
SIGMOD
2010
ACM
598views Database» more  SIGMOD 2010»
14 years 16 days ago
Ricardo: integrating R and Hadoop
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...
TCAD
2008
100views more  TCAD 2008»
13 years 7 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...