4502 search results - page 255 / 901 » Regular Model Checking |
169
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
170
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
204
click to vote
CIKM
2007
Springer
16 years 18 days ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
155
click to vote
ARTS
1997
Springer
15 years 10 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
203
click to vote
NIPS
2008
15 years 7 months ago
2008
For many supervised learning problems, we possess prior knowledge about which features yield similar information about the target variable. In predicting the topic of a document, ...