Sciweavers

221 search results - page 14 / 45
» Efficient sampling of random permutations
Sort
View
MMAS
2010
Springer
13 years 2 months ago
A Novel Method for Solving Multiscale Elliptic Problems with Randomly Perturbed Data
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
Victor Ginting, Axel Målqvist, Michael Presh...
ICMLA
2008
13 years 9 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
PAMI
2008
270views more  PAMI 2008»
13 years 7 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
IROS
2006
IEEE
162views Robotics» more  IROS 2006»
14 years 1 months ago
Efficiency Improvement in Monte Carlo Localization through Topological Information
- Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Many studies have been conducted to improve performance of MCL. Al...
Tae-Bum Kwon, Ju-Ho Yang, Jae-Bok Song, Woojin Chu...