Sciweavers

1321 search results - page 88 / 265
» Quadratic forms on graphs
Sort
View
120
Voted
ACL
2010
14 years 10 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
15 years 7 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
100
Voted
ESOP
2004
Springer
15 years 6 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
98
Voted
SIAMDM
2008
79views more  SIAMDM 2008»
15 years 19 days ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...
101
Voted
IPL
2007
101views more  IPL 2007»
15 years 18 days ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik