Sciweavers

2834 search results - page 284 / 567
» Representing Trees with Constraints
Sort
View
AUSAI
2003
Springer
15 years 12 months ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
15 years 10 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
FAABS
2004
Springer
15 years 10 months ago
Formal Consistency Verification of Deliberative Agents with Respect to Communication Protocols
The aim of this paper is to show a method that is able to detect inconsistencies in the reasoning carried out by a deliberative agent. The agent is supposed to be provided with a h...
Jaime Ramírez, Angélica de Antonio
VLDB
2000
ACM
136views Database» more  VLDB 2000»
15 years 10 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
GLVLSI
2010
IEEE
154views VLSI» more  GLVLSI 2010»
15 years 8 months ago
Resource-constrained timing-driven link insertion for critical delay reduction
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
Jin-Tai Yan, Zhi-Wei Chen