1168 search results - page 118 / 234 » cases 2000 |
183
click to vote
NETWORKING
2000
15 years 6 months ago
2000
We present an approximate analytical method to compute efficiently the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairl...
116
click to vote
NIPS
2000
15 years 6 months ago
2000
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
127
click to vote
NIPS
2000
15 years 6 months ago
2000
Modern classification applications necessitate supplementing the few available labeled examples with unlabeled examples to improve classification performance. We present a new tra...
161
click to vote
PUK
2000
15 years 6 months ago
2000
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
142
Voted
RIAO
2000
15 years 6 months ago
2000
We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approac...