Sciweavers

413 search results - page 41 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
IJCV
2008
282views more  IJCV 2008»
16 years 10 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
IPPS
2000
IEEE
15 years 10 months ago
ClusterNet: An Object-Oriented Cluster Network
Abstract. Parallel processing is based on utilizing a group of processors to efficiently solve large problems faster than is possible on a single processor. To accomplish this, the...
Raymond Hoare
135
Voted
ICNP
1996
IEEE
15 years 10 months ago
Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
170
Voted
DCOSS
2006
Springer
15 years 9 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni
172
Voted
COMGEO
2008
ACM
15 years 6 months ago
Constructing minimum-interference networks
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
Marc Benkert, Joachim Gudmundsson, Herman J. Haver...