Sciweavers

2520 search results - page 249 / 504
» The complexity of approximating entropy
Sort
View
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 3 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
16 years 1 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ICCS
2009
Springer
16 years 1 months ago
Spatial Relations Analysis by Using Fuzzy Operators
Spatial relations play important role in computer vision, scene analysis, geographic information systems (GIS) and content based image retrieval. Analyzing spatial relations by Fo...
Nadeem Salamat, El-hadi Zahzah
ICC
2008
IEEE
127views Communications» more  ICC 2008»
16 years 1 months ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
INFOCOM
2008
IEEE
16 years 1 months ago
Information Concealing Games
— Consider the situation in which a decision maker (Actor) has to decide which of several available resources to use in the presence of an adversary (called Controller) that can ...
Saswati Sarkar, Eitan Altman, Rachid El Azouzi, Ye...