Sciweavers

4744 search results - page 484 / 949
» Connected Computing
Sort
View
COMPGEOM
1997
ACM
15 years 10 months ago
The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
Karl-Friedrich Böhringer, Bruce Randall Donal...
INFOCOM
1996
IEEE
15 years 10 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
INFOCOM
1996
IEEE
15 years 10 months ago
Network Security via Reverse Engineering of TCP Code: Vulnerability Analysis and Proposed Solutions
The Transmission Control Protocol Internet Protocol TCP IP 1 suite is a very widely used technique that is employed to interconnect computing facilities in modern network environm...
Biswaroop Guha, Biswanath Mukherjee
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 10 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
ICANN
2007
Springer
15 years 10 months ago
An Efficient Method for Pruning the Multilayer Perceptron Based on the Correlation of Errors
Abstract. In this paper we present a novel method for pruning redundant weights of a trained multilayer Perceptron (MLP). The proposed method is based on the correlation analysis o...
Cláudio M. S. Medeiros, Guilherme De A. Bar...