Sciweavers

2374 search results - page 184 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
103
Voted
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 2 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 6 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
143
Voted
ACSC
2003
IEEE
15 years 8 months ago
A Practical Method to Counteract Denial of Service Attacks
Today distributed denial of service (DDoS) attacks are causing major problems to conduct online business over the Internet. Recently several schemes have been proposed on how to p...
Udaya Kiran Tupakula, Vijay Varadharajan
ISCAS
2008
IEEE
179views Hardware» more  ISCAS 2008»
15 years 9 months ago
Direction of arrival estimation for speech sources using fourth order cross cumulants
— In many applications where speech separation and enhancement is of interest, e.g. conferencing systems, mobile phones and hearing aids, accurate speaker localization is importa...
Mikael Swarding, Benny Sallberg, Nedelko Grbic
130
Voted
SAC
2008
ACM
15 years 2 months ago
Model-driven development of component-based adaptive distributed applications
This paper introduces an approach to develop componentbased adaptive distributed applications. Our approach separates the communication and the functional aspects of a distributed...
An Phung-Khac, Antoine Beugnard, Jean-Marie Gillio...