Sciweavers

4112 search results - page 533 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
15 years 7 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
IPPS
2010
IEEE
15 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
15 years 5 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
3DOR
2010
15 years 2 months ago
Learning the Compositional Structure of Man-Made Objects for 3D Shape Retrieval
While approaches based on local features play a more and more important role for 3D shape retrieval, the problems of feature selection and similarity measurement between sets of l...
Raoul Wessel, Reinhard Klein
TASE
2010
IEEE
15 years 2 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang