Sciweavers

6833 search results - page 15 / 1367
» Some two-character sets
Sort
View
AMC
2006
82views more  AMC 2006»
13 years 7 months ago
Some thoughts on hypercomputation
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
Newton C. A. da Costa, Francisco A. Doria
ITA
2008
119views Communications» more  ITA 2008»
13 years 7 months ago
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
Aleksandrs Belovs
DM
2002
76views more  DM 2002»
13 years 7 months ago
Chromaticity of some families of dense graphs
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, ...
IUI
2012
ACM
12 years 3 months ago
Performance comparisons of phrase sets and presentation styles for text entry evaluations
We empirically compare five different publicly-available phrase sets in two large-scale (N = 225 and N = 150) crowdsourced text entry experiments. We also investigate the impact ...
Per Ola Kristensson, Keith Vertanen
DEXA
2009
Springer
176views Database» more  DEXA 2009»
13 years 5 months ago
Analyzing Document Retrievability in Patent Retrieval Settings
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in sp...
Shariq Bashir, Andreas Rauber