Sciweavers

4743 search results - page 504 / 949
» The PlusCal Algorithm Language
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 7 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
EUROSYS
2007
ACM
15 years 7 months ago
Automatic configuration of internet services
Recent research has found that operators frequently misconfigure Internet services, causing various availability and performance problems. In this paper, we propose a software inf...
Wei Zheng, Ricardo Bianchini, Thu D. Nguyen
SP
2010
IEEE
182views Security Privacy» more  SP 2010»
15 years 7 months ago
All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask)
—Dynamic taint analysis and forward symbolic execution are quickly becoming staple techniques in security analyses. Example applications of dynamic taint analysis and forward sym...
Edward J. Schwartz, Thanassis Avgerinos, David Bru...
FQAS
2004
Springer
135views Database» more  FQAS 2004»
15 years 7 months ago
Interactive Schema Integration with Sphinx
Abstract. The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repo...
François Barbançon, Daniel P. Mirank...
DAS
2006
Springer
15 years 7 months ago
Finding the Best-Fit Bounding-Boxes
The bounding-box of a geometric shape in 2D is the rectangle with the smallest area in a given orientation (usually upright) that complete contains the shape. The best-fit bounding...
Bo Yuan, Leong Kwoh, Chew Lim Tan