Sciweavers

2273 search results - page 88 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
ECCC
2008
108views more  ECCC 2008»
14 years 10 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
14 years 8 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
ICASSP
2011
IEEE
14 years 1 months ago
Reduced complexity blind deterministic frequency offset estimation in OFDM systems
— This paper proposes an efficient blind deterministic carrier frequency offset (CFO) estimation method for orthogonal frequency division multiplexing (OFDM) systems. In the pro...
Hyoung-Goo Jeon, Kyoung-Soo Kim, Erchin Serpedin
CVPR
2000
IEEE
15 years 12 months ago
Representation and Recognition of Complex Human Motion
The quest for a vision system capable of representing and recognizing arbitrary motions benefits from a low dimensional, non-specific representation of flow fields, to be used in ...
Jesse Hoey, James J. Little
EDBT
2004
ACM
133views Database» more  EDBT 2004»
15 years 10 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum