Sciweavers

6365 search results - page 12 / 1273
» Fast Local Computation Algorithms
Sort
View
PR
2007
340views more  PR 2007»
14 years 9 months ago
Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation
— Fuzzy c-means (FCM) algorithms with spatial constraints (FCM_S) have been proven effective for image segmentation. However, they still have the following disadvantages: 1) Alth...
Weiling Cai, Songcan Chen, Daoqiang Zhang
FUIN
2006
90views more  FUIN 2006»
14 years 9 months ago
Local Computations in Graphs: The Case of Cellular Edge Local Computations
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
Jérémie Chalopin, Yves Métivi...
SIGGRAPH
1999
ACM
15 years 2 months ago
Optimization of Mesh Locality for Transparent Vertex Caching
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
Hugues Hoppe
ICML
2006
IEEE
15 years 10 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
14 years 11 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...