Sciweavers

2570 search results - page 55 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
ECCV
2008
Springer
15 years 11 months ago
A Fast Algorithm for Creating a Compact and Discriminative Visual Codebook
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
Lei Wang, Luping Zhou, Chunhua Shen
ACIVS
2005
Springer
15 years 3 months ago
A Fast Sequential Rainfalling Watershed Segmentation Algorithm
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
Johan de Bock, Patrick de Smet, Wilfried Philips
ICPR
2000
IEEE
15 years 11 months ago
Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms
The segmentation of colored texture images is considered. Either luminance, color, and/or texture features could be used for segmentation. For luminance and color the classes are ...
Spyros Liapis, Eftychios Sifakis, George Tziritas
KES
2004
Springer
15 years 3 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
15 years 3 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd