Sciweavers

831 search results - page 94 / 167
» Coalgebraic Correspondence Theory
Sort
View
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
IEEEIA
2009
14 years 9 months ago
How Emotional Mechanism Helps Episodic Learning in a Cognitive Agent
In this paper we propose the CTS (Concious Tutoring System) technology, a biologically plausible cognitive agent based on human brain functions.This agent is capable of learning a...
Usef Faghihi, Philippe Fournier-Viger, Roger Nkamb...
TSP
2010
14 years 6 months ago
MIMO transceiver optimization with linear constraints on transmitted signal covariance components
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
Ching-Chih Weng, P. P. Vaidyanathan
ESWA
2011
243views Database» more  ESWA 2011»
14 years 3 months ago
A novel case based reasoning approach to radiotherapy planning
Radiotherapy planning is a complex problem which requires both expertise and experience of an oncologist. A Case Based Reasoning (CBR) system is developed to generate dose plans f...
Sanja Petrovic, Nishikant Mishra, Santhanam Sundar
WINE
2005
Springer
161views Economy» more  WINE 2005»
15 years 5 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari