 |
|
 Fast Algorithms for Signal Processing
Efficient signal processing algorithms are important for embedded and power-limited applications since, by reducing the number of computations, power consumption can be reduced significantly. Similarly, efficient algorithms are also critical to very large scale applications such as video processing and four-dimensional medical imaging. This... |  |  Data Management for Multimedia Retrieval
Multimedia data require specialized management techniques because the representations of color, time, semantic concepts, and other underlying information can be drastically different from one another. The user's subjective judgment can also have significant impact on what data or features are relevant in a given context. These factors... |  |  Networks, Crowds, and Markets: Reasoning About a Highly Connected World
Over the past decade there has been a growing public fascination with the complex connectedness of modern society. This connectedness is found in many incarnations: in the rapid growth of the Internet, in the ease with which global communication takes place, and in the ability of news and information as well as epidemics and financial crises... |
|
|
|
 Modem Theory: An Introduction to Telecommunications
At the heart of any modern communication system is the modem, connecting the data source to the communication channel. This first course in the mathematical theory of modem design introduces the theory of digital modulation and coding that underpins the design of digital telecommunications systems. A detailed treatment of core subjects is... |  |  Network Security: A Decision and Game-Theoretic Approach
Covering attack detection, malware response, algorithm and mechanism design, privacy, and risk management, this comprehensive work applies unique quantitative models derived from decision, control, and game theories to understanding diverse network security problems. It provides the reader with a system-level theoretical understanding of... |  |  The Design of Approximation Algorithms
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find... |
|
| Result Page: 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 |