Sciweavers

592 search results - page 118 / 119
» Using Constraint Programming to Solve the Maximum Clique Pro...
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
ISPASS
2006
IEEE
13 years 11 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
SP
2006
IEEE
132views Security Privacy» more  SP 2006»
13 years 11 months ago
Towards Automatic Generation of Vulnerability-Based Signatures
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
David Brumley, James Newsome, Dawn Xiaodong Song, ...
CONEXT
2010
ACM
13 years 3 months ago
Optimal content placement for a large-scale VoD system
IPTV service providers offering Video-on-Demandcurrently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes...
David Applegate, Aaron Archer, Vijay Gopalakrishna...
CASES
2004
ACM
13 years 10 months ago
Balancing design options with Sherpa
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
Timothy Sherwood, Mark Oskin, Brad Calder