3653 search results - page 674 / 731 » On Recognizable Timed Languages |
TALG
2010
14 years 4 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
159
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
137
click to vote
CPP
2011
13 years 9 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
102
click to vote
DAC
2011
ACM
13 years 9 months ago
2011
ACM
SystemC is a popular modeling language which can be used to specify systems at bstraction level. Currently, SystemC tools can not cope with SystemC models for which the module hie...
102
click to vote
ICDT
2012
ACM
13 years 6 days ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...