Sciweavers

9949 search results - page 1734 / 1990
» On the Network Complexity of Selection
Sort
View
IMC
2003
ACM
15 years 12 months ago
Constructing internet coordinate system based on delay measurement
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
Hyuk Lim, Jennifer C. Hou, Chong-Ho Choi
IDEAL
2003
Springer
15 years 12 months ago
Detecting Distributed Denial of Service (DDoS) Attacks through Inductive Learning
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
Sanguk Noh, Cheolho Lee, Kyunghee Choi, Gihyun Jun...
193
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
IPPS
1998
IEEE
15 years 11 months ago
HIPIQS: A High-Performance Switch Architecture Using Input Queuing
Switch-based interconnects are used in a number of application domains including parallel system interconnects, local area networks, and wide area networks. However, very few swit...
Rajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. P...
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
« Prev « First page 1734 / 1990 Last » Next »