Sciweavers

410 search results - page 42 / 82
» A Fast Method for Local Penetration Depth Computation
Sort
View
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 7 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...
ICCSA
2005
Springer
14 years 2 months ago
Quasi-interpolants Based Multilevel B-Spline Surface Reconstruction from Scattered Data
Abstract. This paper presents a new fast and local method of 3D surface reconstruction for scattered data. The algorithm makes use of quasiinterpolants to compute the control point...
Byung-Gook Lee, Joon-Jae Lee, Ki-Ryoung Kwon
ICCV
2005
IEEE
14 years 2 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
CVPR
2009
IEEE
14 years 3 months ago
Fast car detection using image strip features
This paper presents a fast method for detecting multi-view cars in real-world scenes. Cars are artificial objects with various appearance changes, but they have relatively consist...
Wei Zheng, Luhong Liang
GRID
2006
Springer
13 years 8 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui