683 search results - page 55 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
136
click to vote
LCPC
1998
Springer
15 years 6 months ago
1998
Springer
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...
130
Voted
GLOBECOM
2010
IEEE
15 years 18 days ago
2010
IEEE
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 ...
132
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
105
Voted
ICCV
2005
IEEE
15 years 8 months ago
2005
IEEE
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...
135
Voted
CCR
2008
15 years 2 months ago
2008
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...