2221 search results - page 291 / 445 » Experiences Building PlanetLab |
126
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
136
Voted
IFM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present an industrial project conducted at Ericsson Danmark A/S, Telebit where formal methods in the form of Coloured Petri Nets (CP-nets or CPNs) have been used for t...
138
Voted
IJCNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...
108
Voted
IJCNLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper proposes a lexicon-constrained character model that combines both word and character features to solve complicated issues in Chinese morphological analysis. A ...
119
Voted
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
— Ubiquitous computing applications often use a user's context to automatically adjust their behavior to the situation. We have developed three types of wireless sensor node...