Sciweavers

1109 search results - page 144 / 222
» Crawling on web graphs
Sort
View
COLING
2010
14 years 11 months ago
FactRank: Random Walks on a Web of Facts
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
Alpa Jain, Patrick Pantel
CP
2009
Springer
16 years 5 months ago
On the Structure of Industrial SAT Instances
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
Carlos Ansótegui, Jordi Levy, Maria Luisa B...
ICDE
2010
IEEE
208views Database» more  ICDE 2010»
16 years 4 months ago
Intensional Associations in Dataspaces
Dataspace applications necessitate the creation of associations among data items over time. For example, once information about people is extracted from sources on the Web, associa...
Marcos Antonio Vaz Salles, Jens Dittrich, Lukas Bl...
ICALP
2005
Springer
15 years 10 months ago
Spatial Logics for Bigraphs
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
125
Voted
GD
2004
Springer
15 years 10 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...