Sciweavers

1646 search results - page 32 / 330
» fast 2007
Sort
View
DICTA
2003
13 years 11 months ago
A Fast Skeletonization Method
This paper presents an efficient method for extracting the skeleton of a planar shape. The method is based on computing local symmetries of the shape’s linearized contour. The ce...
Ju Jia Zou
ERSA
2003
139views Hardware» more  ERSA 2003»
13 years 11 months ago
Fast Design Space Exploration Method for Reconfigurable Architectures
In this paper we propose an original and fast design space exploration method targeting reconfigurable architectures. This method takes place during the first steps of a design fl...
Lilian Bossuet, Guy Gogniat, Jean Luc Philippe
ACL
1996
13 years 11 months ago
Fast Parsing Using Pruning and Grammar Specialization
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based o...
Manny Rayner, David M. Carter
PR
2007
340views more  PR 2007»
13 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
DMIN
2007
214views Data Mining» more  DMIN 2007»
13 years 11 months ago
A Fast KNN Algorithm Based on Simulated Annealing
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
Chuanyao Yang, Yuqin Li, Chenghong Zhang, Yunfa Hu