Sciweavers

354 search results - page 28 / 71
» Sorting networks on FPGAs
Sort
View
ICNP
1999
IEEE
14 years 3 months ago
Minimum Rate Guarantee Without Per-Flow Information
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi R...
IFIP
2003
Springer
14 years 4 months ago
Self-Organising Node Address Management in Ad Hoc Networks
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...
Stephen Toner, Donal O'Mahony
TIFS
2008
142views more  TIFS 2008»
13 years 11 months ago
An FPGA-Based Network Intrusion Detection Architecture
Abstract--Network intrusion detection systems (NIDSs) monitor network traffic for suspicious activity and alert the system or network administrator. With the onset of gigabit netwo...
Abhishek Das, David Nguyen, Joseph Zambreno, Gokha...
EDBT
2009
ACM
92views Database» more  EDBT 2009»
14 years 5 months ago
NNexus: an automatic linker for collaborative web-based corpora
—In this paper, we introduce NNexus, a generalization of the automatic linking engine of Noosphere (at PlanetMath.org) and the first system that automates the process of linking...
James J. Gardner, Aaron Krowne, Li Xiong
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
14 years 4 months ago
Pricing WiFi at Starbucks: issues in online mechanism design
We consider the problem of designing mechanisms for online problems in which agents arrive over time and the mechanism is unaware of the agent until the agent announces her arriva...
Eric J. Friedman, David C. Parkes