Sciweavers

351 search results - page 42 / 71
» Perfect Constraints Are Tractable
Sort
View
WWW
2006
ACM
14 years 8 months ago
Designing an architecture for delivering mobile information services to the rural developing world
Paper plays a crucial role in many developing world information practices. However, paper-based records are inefficient, error-prone and difficult to aggregate. Therefore we need ...
Tapan S. Parikh, Edward D. Lazowska
PADS
2009
ACM
14 years 2 months ago
An Approach for Validation of Semantic Composability in Simulation Models
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
Claudia Szabo, Yong Meng Teo
IJCAI
2007
13 years 9 months ago
On the Automatic Scoring of Handwritten Essays
Automating the task of scoring handwritten student essays is a challenging problem of AI. The goal is to assign scores which are comparable to those of human scorers even though b...
Sargur N. Srihari, Rohini K. Srihari, Pavithra Bab...
TIT
2008
80views more  TIT 2008»
13 years 7 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir
TWC
2008
120views more  TWC 2008»
13 years 7 months ago
Energy minimization of a QAM system with fading
In this paper, the problem of choosing constellation size and transmit power that minimizes the energy-per-goodbit in a frequency-flat, long-term static fading channel is considere...
Raghavendra S. Prabhu, Babak Daneshrad