Sciweavers

1089 search results - page 105 / 218
» Randomness and Reducibility
Sort
View
ICASSP
2011
IEEE
13 years 2 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
WIOPT
2011
IEEE
13 years 2 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
LPAR
2012
Springer
12 years 5 months ago
Smart Testing of Functional Programs in Isabelle
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Lukas Bulwahn
ICS
1999
Tsinghua U.
14 years 2 months ago
Improving memory hierarchy performance for irregular applications
The performance of irregular applications on modern computer systems is hurt by the wide gap between CPU and memory speeds because these applications typically underutilize multi-...
John M. Mellor-Crummey, David B. Whalley, Ken Kenn...
CONEXT
2007
ACM
14 years 2 months ago
On improving the efficiency and manageability of NotVia
This paper presents techniques that improve the efficiency and manageability of an IP Fast Reroute (IPFRR) technology: NotVia. NotVia provides the IPFRR service for all destinatio...
Ang Li, Pierre Francois, Xiaowei Yang