Sciweavers

4903 search results - page 123 / 981
» The Set Covering Machine
Sort
View
FCT
2005
Springer
14 years 2 months ago
On the Power of Unambiguity in Alternating Machines
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...
Holger Spakowski, Rahul Tripathi
WIOPT
2006
IEEE
14 years 3 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
CAV
2003
Springer
127views Hardware» more  CAV 2003»
14 years 26 days ago
Dense Counter Machines and Verification Problems
We generalize the traditional definition of a multicounter machine (where the counters, which can only assume nonnegative integer values, can be incremented/decremented by 1 and te...
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi S...
ACL
2008
13 years 10 months ago
Segmentation for English-to-Arabic Statistical Machine Translation
In this paper, we report on a set of initial results for English-to-Arabic Statistical Machine Translation (SMT). We show that morphological decomposition of the Arabic source is ...
Ibrahim Badr, Rabih Zbib, James R. Glass
SOFSEM
2012
Springer
12 years 4 months ago
Turing Machines for Dummies - Why Representations Do Matter
Abstract. Various methods exists in the literature for denoting the configuration of a Turing Machine. A key difference is whether the head position is indicated by some integer ...
Peter van Emde Boas