Sciweavers

6365 search results - page 113 / 1273
» Fast Local Computation Algorithms
Sort
View
147
Voted
PRL
2010
188views more  PRL 2010»
14 years 9 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...
114
Voted
CSDA
2006
98views more  CSDA 2006»
15 years 2 months ago
Fast estimation algorithm for likelihood-based analysis of repeated categorical responses
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
Jukka Jokinen
PPOPP
2012
ACM
13 years 10 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
120
Voted
ECCV
2008
Springer
16 years 4 months ago
Localizing Objects with Smart Dictionaries
Abstract. We present an approach to determine the category and location of objects in images. It performs very fast categorization of each pixel in an image, a brute-force approach...
Brian Fulkerson, Andrea Vedaldi, Stefano Soatto
ECCV
2004
Springer
16 years 4 months ago
Face Recognition with Local Binary Patterns
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...
Abdenour Hadid, Matti Pietikäinen, Timo Ahone...