Sciweavers

1170 search results - page 39 / 234
» How Fast Is Too Fast
Sort
View
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 3 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
120
Voted
ICPR
2010
IEEE
15 years 2 months ago
Fast Odometry Integration in Local Bundle Adjustment-Based Visual SLAM
The Simultaneous Localisation And Mapping (SLAM) for a camera moving in a scene is a long term research problem. Here we improve a recent visual SLAM which applies Local Bundle Ad...
Alexandre Eudes, Maxime Lhuillier, Sylvie Naudet-C...
TWC
2008
124views more  TWC 2008»
15 years 2 months ago
Reverse Link Performance of a DS-CDMA System With Both Fast and Slow Power Controlled Users
In this paper the performance of the reverse link of a multicell DS-CDMA system with coexisting open-loop and closed-loop power controlled users transmitting heterogeneous traffic ...
Loren Carrasco, Guillem Femenias
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 9 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 9 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König