Sciweavers

2104 search results - page 338 / 421
» Sorting with networks of data structures
Sort
View
120
Voted
P2P
2009
IEEE
114views Communications» more  P2P 2009»
15 years 11 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 11 months ago
An evolutionary approach to constructive induction for link discovery
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
Tim Weninger, William H. Hsu, Jing Xia, Waleed Alj...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 10 months ago
A Novel Algorithm and Architecture for High Speed Pattern Matching in Resource-Limited Silicon Solution
— Network Intrusion Detection Systems (NIDS) are more and more important for identifying and preventing the malicious attacks over the network. This paper proposes a novel cost-e...
Nen-Fu Huang, Yen-Ming Chu, Chi-Hung Tsai, Chen-Yi...
INFOCOM
2007
IEEE
15 years 10 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
IWNAS
2006
IEEE
15 years 10 months ago
Hint-based Routing in WSNs using Scope Decay Bloom Filters
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
Xiuqi Li, Jie Wu, Jun (Jim) Xu