Sciweavers

2969 search results - page 235 / 594
» A space efficient algorithm for group structure computation
Sort
View
DCC
2007
IEEE
16 years 3 months ago
On the structure of 1-designs with at most two block intersection numbers
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
John Arhin
GBRPR
2007
Springer
15 years 10 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
SAC
2008
ACM
15 years 3 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
ASC
2004
15 years 4 months ago
Soft computing applications in dynamic model identification of polymer extrusion process
This paper proposes the applications of soft computing to deal with the constraints in conventional modelling techniques of the dynamic extrusion process. The proposed technique i...
Leong Ping Tan, Ahmad Lotfi, Eugene Lai, J. B. Hul...
HT
1996
ACM
15 years 8 months ago
HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...
Ron Weiss, Bienvenido Vélez, Mark A. Sheldo...