Sciweavers

35 search results - page 4 / 7
» Counting dependent and independent strings
Sort
View
CCS
2010
ACM
14 years 8 months ago
Platform-independent programs
Given a single program (i.e., bit string), one may assume that the program's behaviors can be determined by first identifying the native runtime architecture and then executi...
Sang Kil Cha, Brian Pak, David Brumley, Richard Ja...
PODS
2000
ACM
179views Database» more  PODS 2000»
15 years 2 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
ICWN
2003
14 years 11 months ago
The Effect of Disengaging RTS/CTS Dialogue in IEEE 802.11 MAC Protocol
In this paper, we study the effect of using or disengaging the RTS/CTS dialogue in IEEE 802.11 DCF MAC protocol incorporating the realistic condition under which carrier sensing, ...
Laura Huei-jiun Ju, Izhak Rubin
BSL
2000
153views more  BSL 2000»
14 years 10 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
ICST
2009
IEEE
15 years 4 months ago
Predicting Attack-prone Components
GEGICK, MICHAEL CHARLES. Predicting Attack-prone Components with Source Code Static Analyzers. (Under the direction of Laurie Williams). No single vulnerability detection techniqu...
Michael Gegick, Pete Rotella, Laurie A. Williams