Sciweavers

2969 search results - page 35 / 594
» A space efficient algorithm for group structure computation
Sort
View
RECOMB
2004
Springer
16 years 3 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
AAAI
2004
15 years 4 months ago
Spatial Aggregation for Qualitative Assessment of Scientific Computations
Qualitative assessment of scientific computations is an emerging application area that applies a data-driven approach to characterize, at a high level, phenomena including conditi...
Chris Bailey-Kellogg, Naren Ramakrishnan
RTA
1997
Springer
15 years 7 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
GECCO
2008
Springer
250views Optimization» more  GECCO 2008»
15 years 4 months ago
Community detection in social networks with genetic algorithms
A new genetic algorithm to detect communities in social networks is presented. The algorithm uses a fitness function able to identify groups of nodes in the network having dense ...
Clara Pizzuti
CVPR
2000
IEEE
16 years 5 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura