Sciweavers

1981 search results - page 193 / 397
» Model-Checking Hierarchical Structures
Sort
View
PAMI
2011
14 years 10 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
ICIP
2003
IEEE
16 years 4 months ago
Stochastic attributed K-d tree modeling of technical paper title pages
Structural information about a document is essential for structured query processing, indexing, and retrieval. A document page can be partitioned into a hierarchy of homogeneous r...
Song Mao, Azriel Rosenfeld, Tapas Kanungo
ISMIS
2005
Springer
15 years 8 months ago
A Query Expression and Processing Technique for an XML Search Engine
Abstract. One of the virtues of XML is that it allows complex structures to be easily expressed. This allows XML to be used as an intermediate, neutral, and standard form for repre...
Wol-Young Lee, Hwan-Seung Yong
EUMAS
2006
15 years 4 months ago
Coordinating Tasks in Agent Organizations
Abstract. Support for new forms of organization and social interaction requires understanding the influence of structure on behavior. Goal dependencies indicate some relationship b...
Virginia Dignum, Frank Dignum
CGF
2002
116views more  CGF 2002»
15 years 3 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal