Sciweavers

5607 search results - page 738 / 1122
» Graph structure in the Web
Sort
View
219
Voted
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 7 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
215
Voted
FOCS
2008
IEEE
16 years 1 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
193
Voted
ICSM
2005
IEEE
16 years 14 days ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
236
Voted
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 11 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger