Sciweavers

33 search results - page 5 / 7
» Least Common Subsumption as a connective
Sort
View
WIKIS
2009
ACM
14 years 2 months ago
Bipartite networks of Wikipedia's articles and authors: a meso-level approach
This exploratory study investigates the bipartite network of articles linked by common editors in Wikipedia, ‘The Free Encyclopedia that Anyone Can Edit’. We use the articles ...
Rut Jesus, Martin Schwartz, Sune Lehmann
COCOA
2007
Springer
14 years 1 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 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...
NECO
2011
13 years 2 months ago
Collective Stability of Networks of Winner-Take-All Circuits
The neocortex has a remarkably uniform neuronal organization, suggesting that common principles of processing are employed throughout its extent. In particular, the patterns of co...
Ueli Rutishauser, Rodney J. Douglas, Jean-Jacques ...
CSE
2009
IEEE
14 years 2 months ago
Black Bridge: A Scatternet Formation Algorithm for Solving a New Emerging Problem
Abstract: Nowadays, it has become common to equip a device with Bluetooth. As such devices become pervasive in the world; much work has been done on forming them into a network, ho...
Yanqin Yang, Minyi Guo, Feilong Tang, Gongwei Zhan...