Sciweavers

2034 search results - page 184 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
EMMCVPR
1997
Springer
14 years 12 days ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ISPA
2007
Springer
14 years 2 months ago
Parallelization Strategies for the Points of Interests Algorithm on the Cell Processor
The Cell processor is a typical example of a heterogeneous multiprocessor-on-chip architecture that uses several levels of parallelism to deliver high performance. Closing the gap ...
Tarik Saidani, Lionel Lacassagne, Samir Bouaziz, T...
CLUSTER
2009
IEEE
14 years 3 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
SACMAT
2005
ACM
14 years 1 months ago
Role mining with ORCA
With continuously growing numbers of applications, enterprises face the problem of efficiently managing the assignment of access permissions to their users. On the one hand, secur...
Jürgen Schlegelmilch, Ulrike Steffens
EDBTW
2004
Springer
14 years 1 months ago
A Simulation Framework for Schema-Based Query Routing in P2P-Networks
Current simulations of P2P-networks don’t take any kind of schemas into account. We present a simulation-framework and first results for query routing based on extensible schema...
Wolf Siberski, Uwe Thaden