Sciweavers

6365 search results - page 96 / 1273
» Fast Local Computation Algorithms
Sort
View
ICPR
2000
IEEE
16 years 7 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 11 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
CVPR
2005
IEEE
16 years 8 months ago
A Non-Local Algorithm for Image Denoising
We propose a new measure, the method noise, to evaluate and compare the performance of digital image denoising methods. We first compute and analyze this method noise for a wide c...
Antoni Buades, Bartomeu Coll, Jean-Michel Morel
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
15 years 12 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
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela