Sciweavers

3653 search results - page 265 / 731
» On Recognizable Timed Languages
Sort
View
AIS
2000
Springer
15 years 7 months ago
A comparison between Maya hieroglyphs and computer icons
Interface design normally follows the traditional approach of Art and Design, which requires reworking to refine an idea through visual playfulness until a solution has been achiev...
Paul Honeywill
FUIN
2008
102views more  FUIN 2008»
15 years 6 months ago
Some Aspects of Parsing Expression Grammar
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...
Roman R. Redziejowski
INTERNET
2010
153views more  INTERNET 2010»
15 years 5 months ago
Composition as a Service
— Software as a Service (SaaS) and the possibility to compose Web services provisioned over the Internet are important assets for a service-oriented architecture (SOA). However, ...
M. Brian Blake, Wei Tan, Florian Rosenberg
SIGMOD
2010
ACM
155views Database» more  SIGMOD 2010»
15 years 5 months ago
Querying RDF streams with C-SPARQL
Continuous SPARQL (C-SPARQL) is a new language for continuous queries over streams of RDF data. CSPARQL queries consider windows, i.e., the most recent triples of such streams, ob...
Davide Francesco Barbieri, Daniele Braga, Stefano ...
EMNLP
2010
15 years 5 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura