Sciweavers

1381 search results - page 145 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
EURODAC
1995
IEEE
202views VHDL» more  EURODAC 1995»
15 years 7 months ago
Hardware-software co-synthesis of fault-tolerant real-time distributed embedded systems
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
Santhanam Srinivasan, Niraj K. Jha
MFCS
2001
Springer
15 years 8 months ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine
JMM2
2007
96views more  JMM2 2007»
15 years 4 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
BIRTHDAY
2009
Springer
15 years 11 months ago
Foundations of Temporal Conceptual Data Models
Abstract. This chapter considers the different temporal constructs appeared in the literature of temporal conceptual models (timestamping and evolution constraints), and it provid...
Alessandro Artale, Enrico Franconi
ICASSP
2009
IEEE
15 years 11 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...