Sciweavers

4744 search results - page 103 / 949
» Connected Computing
Sort
View
CGI
2004
IEEE
15 years 6 months ago
Computing Polygonal Surfaces from Unions of Balls
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient ...
Roger C. Tam, Wolfgang Heidrich
WMTE
2002
IEEE
15 years 8 months ago
A Concept Mapping Tool for Pocket PC Computers
We describe the implementation and evaluation of a concept mapping tool for Pocket PC computers. The paper addresses challenges associated with developing a learning tool for hand...
Tony Chan, Mike Sharples
ICPPW
2009
IEEE
15 years 9 months ago
Link and Route Availability for Inter-working Multi-hop Wireless Networks
— In inter-working multi-hop wireless networks, establishing resilient connectivity between source-destination node pairs is a major issue. The issues of connectivity in multihop...
Oladayo Salami, Antoine B. Bagula, H. Anthony Chan
IPPS
1998
IEEE
15 years 7 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman
IJON
2006
79views more  IJON 2006»
15 years 3 months ago
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
Wei Wang 0008, Jean-Jacques E. Slotine