1055 search results - page 52 / 211 » Enumerations in computable structure theory |
CHI
2010
ACM
14 years 5 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
AINA
2009
IEEE
14 years 5 months ago
2009
IEEE
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
UIST
1998
ACM
14 years 2 months ago
1998
ACM
Our goal is to provide tools to support working meetings on an electronic whiteboard, called Tivoli. This paper describes how we have integrated structured domain objects, which r...
IPCO
2008
13 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
WWW
2010
ACM
13 years 10 months ago
2010
ACM
We propose a novel extraction approach that exploits content redundancy on the web to extract structured data from template-based web sites. We start by populating a seed database...