Sciweavers

683 search results - page 55 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
LCPC
1998
Springer
14 years 2 days ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...
GLOBECOM
2010
IEEE
13 years 5 months ago
Adaptive Modulation in Wireless Networks with Smoothed Flow Utility
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
Ekine Akuiyibo, Stephen P. Boyd, Daniel O'Neill
IPPS
2007
IEEE
14 years 2 months ago
A Heterogeneous Lightweight Multithreaded Architecture
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
Sheng Li, Amit Kashyap, Shannon K. Kuntz, Jay B. B...
ICCV
2005
IEEE
14 years 1 months ago
Visual Learning Given Sparse Data of Unknown Complexity
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
Tao Xiang, Shaogang Gong
CCR
2008
84views more  CCR 2008»
13 years 8 months ago
Modeling internet topology dynamics
Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. Whi...
Hamed Haddadi, Steve Uhlig, Andrew W. Moore, Richa...