Sciweavers

1068 search results - page 52 / 214
» Factorization as a Rank 1 Problem
Sort
View
ICIP
2007
IEEE
15 years 11 months ago
Domain-Partitioning Rankboost for Face Recognition
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
Bangpeng Yao, Haizhou Ai, Yoshihisa Ijiri, Shihong...
IROS
2009
IEEE
132views Robotics» more  IROS 2009»
15 years 4 months ago
Segregation in swarms of mobile robots based on the Brazil nut effect
— We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain...
Roderich Groß, Stéphane Magnenat, Fra...
IPL
2011
73views more  IPL 2011»
14 years 4 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
MOC
2000
78views more  MOC 2000»
14 years 9 months ago
Using number fields to compute logarithms in finite fields
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
Oliver Schirokauer
TSD
2010
Springer
14 years 8 months ago
Evaluation of a Sentence Ranker for Text Summarization Based on Roget's Thesaurus
Abstract. Evaluation is one of the hardest tasks in automatic text summarization. It is perhaps even harder to determine how much a particular component of a summarization system c...
Alistair Kennedy, Stan Szpakowicz