1055 search results - page 152 / 211 » Enumerations in computable structure theory |
WWW
2005
ACM
14 years 9 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
CSCW
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we describe the evolution and impact of computersupported cooperative work (CSCW) research through social network analysis of coauthorship data. A network of author...