Sciweavers

221 search results - page 33 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
TVCG
2008
119views more  TVCG 2008»
13 years 7 months ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...
COMPGEOM
2004
ACM
14 years 1 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 8 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
OTM
2007
Springer
14 years 1 months ago
Decentralised Commitment for Optimistic Semantic Replication
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
Pierre Sutra, João Barreto, Marc Shapiro
SAC
2011
ACM
12 years 10 months ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka