Sciweavers

514 search results - page 79 / 103
» Drawing a Graph in a Hypercube
Sort
View
WWW
2004
ACM
15 years 10 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
15 years 4 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
AIME
2009
Springer
15 years 4 months ago
Segmentation of Text and Non-text in On-Line Handwritten Patient Record Based on Spatio-Temporal Analysis
Note taking is a common way for physicians to collect information from their patients in medical inquiries and diagnoses. Many times, when describing the pathology in medical recor...
Rattapoom Waranusast, Peter Haddawy, Matthew N. Da...
NIPS
2007
14 years 11 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»
14 years 11 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...