Sciweavers

788 search results - page 86 / 158
» Symbolic Equivalence Checking
Sort
View
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 8 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
FUIN
2008
88views more  FUIN 2008»
13 years 7 months ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
Gösta Grahne, Alex Thomo, William W. Wadge
RSEISP
2007
Springer
14 years 1 months ago
Checking Brain Expertise Using Rough Set Theory
Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine lea...
Andrzej W. Przybyszewski
LICS
2006
IEEE
14 years 1 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
CIKM
2006
Springer
13 years 11 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...