Sciweavers

419 search results - page 48 / 84
» Constraint models for graceful graphs
Sort
View
AUSAI
2003
Springer
14 years 19 days 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 ...
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 7 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
SIROCCO
1997
13 years 8 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
ICCD
2000
IEEE
103views Hardware» more  ICCD 2000»
14 years 4 months ago
Efficient Place and Route for Pipeline Reconfigurable Architectures
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
Srihari Cadambi, Seth Copen Goldstein
GISCIENCE
2008
Springer
117views GIS» more  GISCIENCE 2008»
13 years 8 months ago
Refining Topological Relations between Regions Considering Their Shapes
Topological relations are sometimes insufficient for differentiating spatial configurations of two objects with critical difference in their connection styles. In this paper, we pr...
Roland Billen, Yohei Kurata