Sciweavers

528 search results - page 23 / 106
» Degrees of categoricity of computable structures
Sort
View
WSC
2008
13 years 11 months ago
Measuring the effectiveness of the s-metric to produce better network models
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
Isabel Beichl, Brian Cloteaux
ICPP
1994
IEEE
14 years 22 days ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
PAKDD
2010
ACM
167views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Hierarchical Web-Page Clustering via In-Page and Cross-Page Link Structures
Abstract. Despite of the wide diversity of web-pages, web-pages residing in a particular organization, in most cases, are organized with semantically hierarchic structures. For exa...
Cindy Xide Lin, Yintao Yu, Jiawei Han, Bing Liu
ICCS
2004
Springer
14 years 2 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
CSL
2003
Springer
14 years 1 months ago
Constraint Satisfaction with Countable Homogeneous Templates
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
Manuel Bodirsky, Jaroslav Nesetril