Sciweavers

1686 search results - page 159 / 338
» Programs as polygraphs: computability and complexity
Sort
View
151
Voted
HPCN
2000
Springer
15 years 7 months ago
Modelling Control Systems in an Event-Driven Coordination Language
The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures f...
Theophilos A. Limniotes, George A. Papadopoulos
110
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Distributed peer-to-peer beamforming for multiuser relay networks
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state information is assumed to be known at the relays or de...
Haihua Chen, Alex B. Gershman, Shahram Shahbazpana...
111
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
123
Voted
ENTCS
2007
108views more  ENTCS 2007»
15 years 3 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
117
Voted
ICPR
2006
IEEE
16 years 4 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai