Sciweavers

49 search results - page 7 / 10
» Computing Inverse ST in Linear Complexity
Sort
View
IPPS
2008
IEEE
14 years 4 months ago
Modeling and predicting application performance on parallel computers using HPC challenge benchmarks
A method is presented for modeling application performance on parallel computers in terms of the performance of microkernels from the HPC Challenge benchmarks. Specifically, the a...
Wayne Pfeiffer, Nicholas J. Wright
ICRA
2002
IEEE
102views Robotics» more  ICRA 2002»
14 years 2 months ago
Maximally Informative Statistics for Localization and Mapping
This paper presents an algorithm for simultaneous localization and mapping for a mobile robot using monocular vision and odometry. The approach uses Variable State Dimension Filte...
Matthew Deans
TWC
2008
148views more  TWC 2008»
13 years 9 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
ECCC
2010
87views more  ECCC 2010»
13 years 7 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
SAC
2005
ACM
14 years 3 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq