Sciweavers

50808 search results - page 12 / 10162
» A New
Sort
View
CIMCA
2005
IEEE
14 years 2 months ago
A New Evolutionary Algorithm for Determining the Optimal Number of Clusters
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily ...
Wei Lu, Issa Traoré
CIS
2004
Springer
14 years 2 months ago
Mining Medline for New Possible Relations of Concepts
Scientific bibliographies in online databases provide a rich source of information for scientists in support of their research. In this paper, we propose a new method to predict po...
Wei Huang, Yoshiteru Nakamori, Shouyang Wang, Tiej...
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
14 years 1 months ago
A New Approach to Improve Particle Swarm Optimization
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
Liping Zhang, Huanjun Yu, Shangxu Hu
PKC
2001
Springer
111views Cryptology» more  PKC 2001»
14 years 1 months ago
Cryptanalysis of PKP: A New Approach
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
Éliane Jaulmes, Antoine Joux
VLDB
1994
ACM
101views Database» more  VLDB 1994»
14 years 19 days ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman