Sciweavers

1523 search results - page 257 / 305
» Detecting and Sketching the Common
Sort
View
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
CONEXT
2007
ACM
15 years 10 months ago
Practical defenses against BGP prefix hijacking
Prefix hijacking, a misbehavior in which a misconfigured or malicious BGP router originates a route to an IP prefix it does not own, is becoming an increasingly serious security p...
Zheng Zhang, Ying Zhang, Y. Charlie Hu, Zhuoqing M...
HOTOS
2007
IEEE
15 years 10 months ago
HotComments: How to Make Program Comments More Useful?
Program comments have long been used as a common practice for improving inter-programmer communication and code readability, by explicitly specifying programmers' intentions ...
Lin Tan, Ding Yuan, Yuanyuan Zhou
PLDI
2010
ACM
15 years 8 months ago
DRFX: a simple and efficient memory model for concurrent programming languages
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
LISA
2008
15 years 8 months ago
Fast Packet Classification for Snort by Native Compilation of Rules
Signature matching, which includes packet classification and content matching, is the most expensive operation of a signature-based network intrusion detection system (NIDS). In t...
Alok Tongaonkar, Sreenaath Vasudevan, R. Sekar