Sciweavers

1532 search results - page 84 / 307
» The Symbol Grounding Problem
Sort
View
ESOP
2010
Springer
16 years 1 months ago
Fluid Updates: Beyond Strong vs. Weak Updates
Abstract. We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that rela...
Isil Dillig, Thomas Dillig and Alex Aiken
GLOBECOM
2008
IEEE
15 years 10 months ago
Joint Power Loading of Data and Pilots in OFDM Using Imperfect Channel State Information at the Transmitter
— The search for optimality in the design of channel precoders and training symbols in block processing communication systems is one of paramount importance. Finding the best tra...
Chitaranjan P. Sukumar, Ricardo Merched, Ahmed M. ...
AIIA
2007
Springer
15 years 10 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
ESOP
2005
Springer
15 years 9 months ago
Interprocedural Herbrand Equalities
We present an aggressive interprocedural analysis for inferring value equalities which are independent of the concrete interpretation of the operator symbols. These equalities, cal...
Markus Müller-Olm, Helmut Seidl, Bernhard Ste...
STACS
1999
Springer
15 years 8 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...