Sciweavers

820 search results - page 24 / 164
» Inducing Temporal Graphs
Sort
View
ACL
2011
14 years 3 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
60
Voted
JVCA
2006
63views more  JVCA 2006»
14 years 11 months ago
Temporal alignment of communicative gesture sequences
In this paper we address the problem of temporal alignment applied to captured communicative gestures conveying different styles. We propose a representation space that may be con...
Alexis Heloir, Nicolas Courty, Sylvie Gibet, Franc...
75
Voted
EJC
2010
14 years 12 months ago
The flipping puzzle on a graph
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
Hau-wen Huang, Chih-wen Weng
SCAM
2007
IEEE
15 years 6 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting
WG
2001
Springer
15 years 4 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...