Sciweavers

314 search results - page 38 / 63
» connection 1998
Sort
View
TITB
1998
129views more  TITB 1998»
13 years 8 months ago
Interactive DICOM image transmission and telediagnosis over the European ATM network
Abstract— The European High-Performance Information Infrastructure in Medicine, nB3014 (HIM3) project of the Trans-European Network—Integrated Broadband Communications (TEN-IB...
Emanuele Neri, Jean-Philippe Thiran, Davide Carame...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 8 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
NN
1998
Springer
108views Neural Networks» more  NN 1998»
13 years 8 months ago
How embedded memory in recurrent neural network architectures helps learning long-term temporal dependencies
Learning long-term temporal dependencies with recurrent neural networks can be a difficult problem. It has recently been shown that a class of recurrent neural networks called NA...
Tsungnan Lin, Bill G. Horne, C. Lee Giles
WG
1998
Springer
14 years 20 days ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 8 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth