Sciweavers

1722 search results - page 165 / 345
» Variables in Concept Graphs
Sort
View
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...
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 10 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
144
Voted
MFCS
2010
Springer
14 years 8 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
COLOGNETWENTE
2010
14 years 6 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
78
Voted
PERCOM
2007
ACM
15 years 9 months ago
A Wall-Sized Focus Plus Context Display
In this paper we present a wall-sized input system with high accuracy input in the center and lower precision tracking on the remaining parts of the wall. This work complements th...
Sebastian Boring, Otmar Hilliges, Andreas Butz