Sciweavers

3466 search results - page 570 / 694
» Fast computation of special resultants
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 1 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
ICDCSW
2005
IEEE
16 years 1 days ago
Control Theory Optimization of MECN in Satellite Networks
Congestion in the Internet results in wasted bandwidth and also stands in the way of guaranteeing QoS. The effect of congestion is multiplied many fold in Satellite networks, wher...
Arjan Durresi, Mukundan Sridharan, Sriram Chellapp...
ICCSA
2003
Springer
15 years 11 months ago
Knowledge Grid Support for Treatment of Traumatic Brain Injury Victims
Traumatic brain injuries (TBIs) typically result from accidents in which the head strikes an object. Among all traumatic causes of death, the TBI is the most serious one. Moreover,...
Peter Brezany, A. Min Tjoa, Martin Rusnak, Jarmila...
ARITH
1999
IEEE
15 years 10 months ago
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...
Marius A. Cornea-Hasegan, Roger A. Golliver, Peter...
CCS
2010
ACM
15 years 6 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler