Sciweavers

263 search results - page 36 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
TPDS
2010
126views more  TPDS 2010»
14 years 6 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
APWEB
2008
Springer
15 years 1 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
NIPS
2008
15 years 1 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
EVOW
2008
Springer
15 years 1 months ago
Compound Particle Swarm Optimization in Dynamic Environments
Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compoun...
Lili Liu, Dingwei Wang, Shengxiang Yang
CATA
2004
15 years 1 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares