Sciweavers

8838 search results - page 1344 / 1768
» Generalizing Domain Theory
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Efficient configuration and control of sanets using facts
ization of domain-specific programming abstractions for wireless sensor actor networks can greatly ease application development. A high level of abstraction from underlying system...
Kirsten Terfloth, Jochen H. Schiller
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
16 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
EUROSYS
2008
ACM
16 years 3 months ago
Parallax: virtual disks for virtual machines
Parallax is a distributed storage system that uses virtualization to provide storage facilities specifically for virtual environments. The system employs a novel architecture in ...
Dutch T. Meyer, Gitika Aggarwal, Brendan Cully, Ge...
ICCD
2007
IEEE
205views Hardware» more  ICCD 2007»
16 years 3 months ago
Hardware libraries: An architecture for economic acceleration in soft multi-core environments
In single processor architectures, computationallyintensive functions are typically accelerated using hardware accelerators, which exploit the concurrency in the function code to ...
David Meisner, Sherief Reda
« Prev « First page 1344 / 1768 Last » Next »