Sciweavers

4781 search results - page 793 / 957
» Online algorithms for network design
Sort
View
SIGCOMM
2006
ACM
16 years 1 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
ANCS
2005
ACM
16 years 21 days ago
High-throughput linked-pattern matching for intrusion detection systems
This paper presents a hardware architecture for highly efficient intrusion detection systems. In addition, a software tool for automatically generating the hardware is presented....
Zachary K. Baker, Viktor K. Prasanna
WOSP
2005
ACM
16 years 20 days ago
Applying SPE techniques for modeling a grid-enabled JAVA platform
Advances in Internet and the availability of powerful computers and high-speed networks have propitiated the rise of Grids. The scheduling of applications is complex in Grids due ...
Mariela Curiel, M. Angélica Pérez, R...
EUROPKI
2004
Springer
16 years 15 days ago
Trustworthy Accounting for Wireless LAN Sharing Communities
Abstract. The Peer-to-Peer Wireless Network Confederation (P2PWNC) is designed to be an open self-organizing Wireless LAN (WLAN) roaming association where users from one WLAN can a...
Elias C. Efstathiou, George C. Polyzos
IWCMC
2010
ACM
16 years 6 days ago
An oversampling approach for LoS-ToA estimation in interleaved OFDMA
Line-of-sight (LoS) time-of-arrival (ToA) is one of key parameters for network-based localization techniques. Its estimation accuracy depends on the bandwidth of transmitted signa...
Ziming He, Yi Ma, Rahim Tafazolli, Hongju Liu