Sciweavers

243 search results - page 44 / 49
» The Geometry of Strict Maximality
Sort
View
COLING
1990
13 years 9 months ago
Information Extraction and Semantic Constraints
We consider the problem of extracting specified types of information from natural language text. To properly analyze the text, we wish to apply semantic (selectional) constraints ...
Ralph Grishman, John Sterling
CN
2008
140views more  CN 2008»
13 years 8 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 8 months ago
On the Optimality of Successive Decoding in Compress-and-Forward Relay Schemes
In the classical compress-and-forward relay scheme developed by (Cover and El Gamal, 1979), the decoding process operates in a successive way: the destination first decodes the co...
Xiugang Wu, Liang-Liang Xie
TSP
2008
101views more  TSP 2008»
13 years 8 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
JOC
2000
95views more  JOC 2000»
13 years 8 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer