Sciweavers

990 search results - page 100 / 198
» Sub-Graphs of Complete Graph
Sort
View
COCOA
2008
Springer
13 years 10 months ago
Parameterized Graph Editing with Chosen Vertex Degrees
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
Luke Mathieson, Stefan Szeider
IJCV
2008
281views more  IJCV 2008»
13 years 9 months ago
Simultaneous Segmentation and Pose Estimation of Humans Using Dynamic Graph Cuts
Abstract This paper presents a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other state of the art meth...
Pushmeet Kohli, Jonathan Rihan, Matthieu Bray, Phi...
JCP
2007
118views more  JCP 2007»
13 years 8 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
14 years 9 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold
ICTAI
2009
IEEE
14 years 3 months ago
Learning in Local Search
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazu...