Sciweavers

314 search results - page 61 / 63
» connection 1998
Sort
View
COMPUTER
1998
68views more  COMPUTER 1998»
13 years 7 months ago
Making Network Interfaces Less Peripheral
Much of a computer’s value depends on how well it interacts with networks. To enhance this value, designers must improve the performance of networks delivered to users. Fortunat...
Shubhendu S. Mukherjee, Mark D. Hill
JCNS
1998
134views more  JCNS 1998»
13 years 7 months ago
Analytical and Simulation Results for Stochastic Fitzhugh-Nagumo Neurons and Neural Networks
An analytical approach is presented for determining the response of a neuron or of the activity in a network of connected neurons, represented by systems of nonlinear ordinary stoc...
Henry C. Tuckwell, Roger Rodriguez
JMIV
1998
106views more  JMIV 1998»
13 years 7 months ago
Linear Scale-Space Theory from Physical Principles
In the past decades linear scale-space theory was derived on the basis of various axiomatics. In this paper we revisit these axioms and show that they merely coincide with the foll...
Alfons H. Salden, Bart M. ter Haar Romeny, Max A. ...
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch