Sciweavers

3653 search results - page 329 / 731
» On Recognizable Timed Languages
Sort
View
JOT
2002
52views more  JOT 2002»
15 years 6 months ago
Negotiable Interfaces for Components
es are extended with a factorable, abstract state, and methods of interfaces are extended with state transformation behaviours. A new programming language command, the USE statemen...
Simon D. Kent, Chris Ho-Stuart, Paul Roe
SAC
2002
ACM
15 years 6 months ago
Secure mobile agent systems using Java: where are we heading?
Java is the predominant language for mobile agent systems, both for implementing mobile agent execution environments and for writing mobile agent applications. This is due to inhe...
Walter Binder, Volker Roth
NLE
2007
78views more  NLE 2007»
15 years 6 months ago
Choosing the content of textual summaries of large time-series data sets
Natural Language Generation (NLG) can be used to generate textual summaries of numeric data sets. In this paper we develop an architecture for generating short (a few sentences) s...
Jin Yu, Ehud Reiter, Jim Hunter, Chris Mellish
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 5 months ago
Evolving Graph Representation and Visualization
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
Anurat Chapanond, Mukkai S. Krishnamoorthy, G. M. ...
CP
2010
Springer
15 years 5 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard