Sciweavers

7853 search results - page 1113 / 1571
» Learning from Each Other
Sort
View
ECCC
1998
88views more  ECCC 1998»
15 years 6 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
191
Voted
GIS
1998
ACM
15 years 6 months ago
Natural-Language Spatial Relations Between Linear and Areal Objects: The Topology and Metric of English-Language Terms
Spatial relations are the basis for many selections users perform when they query geographic information systems (GISs). Although such query languages use natural-language-like te...
A. Rashid B. M. Shariff, Max J. Egenhofer, David M...
PE
1998
Springer
104views Optimization» more  PE 1998»
15 years 6 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni
TIT
1998
89views more  TIT 1998»
15 years 6 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
212
Voted
VLDB
2002
ACM
135views Database» more  VLDB 2002»
15 years 6 months ago
Maintaining Coherency of Dynamic Data in Cooperating Repositories
In this paper, we consider techniques for disseminating dynamic data--such as stock prices and real-time weather information--from sources to a set of repositories. We focus on th...
Shetal Shah, Krithi Ramamritham, Prashant J. Sheno...
« Prev « First page 1113 / 1571 Last » Next »