Sciweavers

537 search results - page 35 / 108
» A Call to Regularity
Sort
View
ICALP
2010
Springer
14 years 14 days ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
CHI
1997
ACM
13 years 12 months ago
The Rockin' Mouse: Integral 3D Manipulation on a Plane
A novel input device called the Rockin’Mouse is described and evaluated. The Rockin’Mouse is a four degree-of-freedom input device that has the same shape as a regular mouse e...
Ravin Balakrishnan, Thomas Baudel, Gordon Kurtenba...
DLT
2006
13 years 9 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
JAIR
2011
166views more  JAIR 2011»
13 years 2 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
JEI
2006
82views more  JEI 2006»
13 years 7 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong