Sciweavers

79 search results - page 13 / 16
» Linear programming bounds for unitary space time codes
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
84
Voted
ASAP
2010
IEEE
148views Hardware» more  ASAP 2010»
14 years 11 months ago
Function flattening for lease-based, information-leak-free systems
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
Xun Li, Mohit Tiwari, Timothy Sherwood, Frederic T...
86
Voted
SIGSOFT
2007
ACM
15 years 10 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
97
Voted
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
DSN
2009
IEEE
15 years 4 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni