Sciweavers

1697 search results - page 180 / 340
» On Bayesian Case Matching
Sort
View
119
Voted
ICALP
1994
Springer
15 years 7 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
132
Voted
ACSAC
2004
IEEE
15 years 7 months ago
Detecting Attacks That Exploit Application-Logic Errors Through Application-Level Auditing
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
Jingyu Zhou, Giovanni Vigna
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 5 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
MFCS
2010
Springer
15 years 1 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
145
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Azimuth-elevation direction finding using power measurements from single antenna
This paper considers the problem of extending the single antenna power measurements based direction finding to the two-dimensional (2D) case, and proposes a method to estimate th...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...