Sciweavers

1013 search results - page 130 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
DBKDA
2009
IEEE
99views Database» more  DBKDA 2009»
15 years 10 months ago
An Adaptive Synchronization Policy for Harvesting OAI-PMH Repositories
Metadata harvesting requires timely propagation of up-to-date information from thousands of Repositories over a wide area network. It is desirable to keep the data as fresh as poss...
Noha Adly
CEC
2008
IEEE
16 years 23 days ago
Decentralised distributed multiple objective particle swarm optimisation using peer to peer networks
—This paper describes a distributed particle swarm optimisation algorithm (PSO) based on peer-to-peer computer networks. A number of modifications are made to the more tradition...
Ian Scriven, Andrew Lewis, David Ireland, Junwei L...
COCOON
2005
Springer
15 years 12 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
CVPR
2004
IEEE
16 years 8 months ago
Motion Estimation by Swendsen-Wang Cuts
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
Adrian Barbu, Alan L. Yuille
ICAC
2005
IEEE
15 years 12 months ago
Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
Gokul Soundararajan, Kaloian Manassiev, Jin Chen, ...