Sciweavers

11231 search results - page 2239 / 2247
» Digging for Data Structures
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
CORR
2011
Springer
219views Education» more  CORR 2011»
13 years 2 months ago
Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 2 months ago
Aging in language dynamics
Human languages evolve continuously, and a puzzling problem is how to reconcile the apparent robustness of most of the deep linguistic structures we use with the evidence that the...
Animesh Mukherjee, Francesca Tria, Andrea Baronche...
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ECCC
2011
188views ECommerce» more  ECCC 2011»
13 years 2 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
« Prev « First page 2239 / 2247 Last » Next »