Sciweavers

5785 search results - page 947 / 1157
» Approximability of Probability Distributions
Sort
View
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 4 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
AUTOMATICA
1999
96views more  AUTOMATICA 1999»
15 years 4 months ago
Optimization of kanban-based manufacturing systems
We develop and analyze an algorithm to maximize the throughput of a serial kanbanbased manufacturing system with arbitrary arrival and service process distributions by adjusting t...
Christos G. Panayiotou, Christos G. Cassandras
IJCV
1998
102views more  IJCV 1998»
15 years 4 months ago
Improved Diffuse Reflection Models for Computer Vision
There are many computational vision techniques that fundamentally rely upon assumptions about the nature of diffuse reflection from object surfaces consisting of commonly occurrin...
Lawrence B. Wolff, Shree K. Nayar, Michael Oren
TIT
1998
79views more  TIT 1998»
15 years 4 months ago
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
Chuanyi Ji, Demetri Psaltis
TIT
1998
89views more  TIT 1998»
15 years 4 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