Sciweavers

8695 search results - page 1736 / 1739
» Making the Complex Simple
Sort
View
MOBISYS
2010
ACM
13 years 9 months ago
Augmenting mobile 3G using WiFi
We investigate if WiFi access can be used to augment 3G capacity in mobile environments. We first conduct a detailed study of 3G and WiFi access from moving vehicles, in three dif...
Aruna Balasubramanian, Ratul Mahajan, Arun Venkata...
FSTTCS
2009
Springer
14 years 1 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ISCA
2007
IEEE
110views Hardware» more  ISCA 2007»
14 years 1 months ago
A novel dimensionally-decomposed router for on-chip communication in 3D architectures
Much like multi-storey buildings in densely packed metropolises, three-dimensional (3D) chip structures are envisioned as a viable solution to skyrocketing transistor densities an...
Jongman Kim, Chrysostomos Nicopoulos, Dongkook Par...
ECOOP
2010
Springer
13 years 12 months ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
14 years 7 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
« Prev « First page 1736 / 1739 Last » Next »