Sciweavers

11211 search results - page 1826 / 2243
» Data Structures
Sort
View
ICFP
2006
ACM
16 years 6 months ago
Delimited dynamic binding
Dynamic binding and delimited control are useful together in many settings, including Web applications, database cursors, and mobile code. We examine this pair of language feature...
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
IWNAS
2008
IEEE
16 years 1 months ago
POND: The Power of Zone Overlapping in DHT Networks
— Distributed Hash Table (DHT) based algorithms have been proposed to solve the routing issues in large-scale Peer-to-Peer (P2P) applications. DHT systems create an elegant Peer-...
Zhiyong Xu, Jizhong Han, Laxmi N. Bhuyan
INFOCOM
2007
IEEE
16 years 1 months ago
TriBiCa: Trie Bitmap Content Analyzer for High-Speed Network Intrusion Detection
Abstract—Deep packet inspection (DPI) is often used in network intrusion detection and prevention systems (NIDPS), where incoming packet payloads are compared against known attac...
N. Sertac Artan, H. Jonathan Chao
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 1 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
COMPGEOM
2006
ACM
16 years 24 days ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
« Prev « First page 1826 / 2243 Last » Next »