Sciweavers

436 search results - page 65 / 88
» Lombardi Drawings of Graphs
Sort
View
NIPS
2007
13 years 10 months ago
TrueSkill Through Time: Revisiting the History of Chess
We extend the Bayesian skill rating system TrueSkill to infer entire time series of skills of players by smoothing through time instead of filtering. The skill of each participat...
Pierre Dangauthier, Ralf Herbrich, Tom Minka, Thor...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 10 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...
WSC
1998
13 years 9 months ago
Windows-based Animation with PROOF
Proof AnimationTM is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, midsize...
James O. Henriksen
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 6 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
GD
2006
Springer
14 years 4 days ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel