2487 search results - page 404 / 498 » Partitions of Graphs into Trees |
ASSETS
2005
ACM
13 years 10 months ago
2005
ACM
While strings and syntax trees are used by the Natural Language Processing community to represent the structure of spoken languages, these encodings are difficult to adapt to a si...
AAAI
2010
13 years 9 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
IPCO
2007
13 years 9 months ago
2007
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
NIPS
2007
13 years 9 months ago
2007
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
CG
2008
Springer
13 years 8 months ago
2008
Springer
Many volume data possess symmetric features that can be clearly observed, for example, those existing in diffusion tensor image data sets. The exploitations of symmetries for volu...