25 search results - page 5 / 5 » Linear Systems for Regular Hedge Languages |
ERLANG
2003
ACM
13 years 11 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
UM
2009
Springer
14 years 24 days ago
2009
Springer
Clustering of search results has been shown to be advantageous over the simple list presentation of search results. However, in most clustering interfaces, the clusters are not ada...
POPL
2008
ACM
14 years 6 months ago
2008
ACM
An ad hoc data source is any semistructured data source for which useful data analysis and transformation tools are not readily available. Such data must be queried, transformed a...
EMNLP
2007
13 years 7 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...