Sciweavers

ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 2 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
14 years 2 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin
ICLP
1997
Springer
14 years 2 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian
ICANN
1997
Springer
14 years 2 months ago
Real-Time Analog VLSI Sensors for 2-D Direction of Motion
Optical ow elds are a primary source of information about the visual scene in technical and biological systems. In a step towards a system for real time scene analysis we have deve...
Rainer A. Deutschmann, Charles M. Higgins, Christo...
SP
1996
IEEE
101views Security Privacy» more  SP 1996»
14 years 2 months ago
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications
We present new results on a distributable changedetection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating...
Patrik D'haeseleer, Stephanie Forrest, Paul Helman
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 2 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
IPPS
1996
IEEE
14 years 2 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
INFOCOM
1996
IEEE
14 years 2 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
COLT
1997
Springer
14 years 2 months ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans