Sciweavers

19866 search results - page 243 / 3974
» Computing all factorizations in ***
Sort
View
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
16 years 22 days ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
CAD
1999
Springer
15 years 6 months ago
Computing offsets of NURBS curves and surfaces
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
Les A. Piegl, Wayne Tiller
IJCNN
2006
IEEE
16 years 20 days ago
Methods for Parallelizing the Probabilistic Neural Network on a Beowulf Cluster Computer
—In this paper, we present three different methods for implementing the Probabilistic Neural Network on a Beowulf cluster computer. The three methods, Parallel Full Training Set ...
Jimmy Secretan, Michael Georgiopoulos, Ian Maidhof...
GLOBECOM
2009
IEEE
15 years 4 months ago
Efficient Data Collection for Wireless Networks: Delay and Energy Tradeoffs
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
Chao Ren, XuFei Mao, Xiang-Yang Li, Ping Xu, Guoju...
ITICSE
2006
ACM
16 years 18 days ago
One step further the ACM K-12 final report: a proposal for level 1: computer organization for K-8
Teaching computer science to children is a major priority in most countries in the world. Nevertheless, Computer Science curricula do not seem to address the children’s world, c...
Giovanni M. Bianco, Simonetta Tinazzi