Sciweavers

4110 search results - page 476 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
UAI
2004
15 years 8 months ago
"Ideal Parent" Structure Learning for Continuous Variable Networks
In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive proced...
Iftach Nachman, Gal Elidan, Nir Friedman
ACL
1998
15 years 8 months ago
Time Mapping with Hypergraphs
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
Jan W. Amtrup, Volker Weber
SPIESR
1996
126views Database» more  SPIESR 1996»
15 years 8 months ago
Tools for Compressed-Domain Video Indexing and Editing
Indexing and editing digital video directly in the compressed domain offer many advantages in terms of storage efficiency and processing speed. We have designed automatic tools in...
Jianhao Meng, Shih-Fu Chang
AAAI
1990
15 years 8 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
GRC
2008
IEEE
15 years 7 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li