Sciweavers

1420 search results - page 40 / 284
» Representation of Graphs by OBDDs
Sort
View
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
16 years 13 days ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
AAAI
2006
15 years 7 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
CEC
2007
IEEE
16 years 16 days ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
SMI
2010
IEEE
159views Image Analysis» more  SMI 2010»
15 years 4 months ago
X-maps: An Efficient Model for Non-manifold Modeling
Abstract--Many representation schemes have been proposed to deal with non-manifold and mixed dimensionalities objects. A majority of those models are based on incidence graphs and ...
David Cazier, Pierre Kraemer
ICDAR
2009
IEEE
15 years 3 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach