Sciweavers

316 search results - page 58 / 64
» On almost self-complementary graphs
Sort
View
SGP
2007
13 years 10 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
AAAI
2007
13 years 10 months ago
Manifold Denoising as Preprocessing for Finding Natural Representations of Data
A natural representation of data is given by the parameters which generated the data. If the space of parameters is continuous, then we can regard it as a manifold. In practice, w...
Matthias Hein, Markus Maier
ALT
2010
Springer
13 years 9 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
LREC
2010
177views Education» more  LREC 2010»
13 years 9 months ago
Maskkot - An Entity-centric Annotation Platform
The Semantic Web is facing the important challenge to maintain its promise of a real world-wide graph of interconnected resources. Unfortunately, while URIs almost guarantee a dir...
Armando Stellato, Heiko Stoermer, Stefano Bortoli,...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 9 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...