Sciweavers

2304 search results - page 260 / 461
» On the Vulnerability of Large Graphs
Sort
View
COLING
2010
15 years 1 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
240
Voted
ICWSM
2009
15 years 4 months ago
Gephi: An Open Source Software for Exploring and Manipulating Networks
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and ...
Mathieu Bastian, Sebastien Heymann, Mathieu Jacomy
CVPR
2010
IEEE
16 years 2 months ago
Globally Optimal Pixel Labeling Algorithms for Tree Metrics
We consider pixel labeling problems where the label set forms a tree, and where the observations are also labels. Such problems arise in feature-space analysis with a very large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
197
Voted
ICDCS
2002
IEEE
15 years 11 months ago
Incremental Replication for Mobility Support in OBIWAN
The need for sharing is well known in a large number of distributed collaborative applications. These applications are difficult to develop for wide area (possibly mobile) networ...
Luís Veiga, Paulo Ferreira
STOC
2012
ACM
185views Algorithms» more  STOC 2012»
13 years 9 months ago
Subspace evasive sets
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
Zeev Dvir, Shachar Lovett