Sciweavers

729 search results - page 119 / 146
» Computing persistent homology
Sort
View
DAC
2007
ACM
16 years 24 days ago
Modeling the Function Cache for Worst-Case Execution Time Analysis
Static worst-case execution time (WCET) analysis is done by modeling the hardware behavior. In this paper we describe a WCET analysis technique to analyze systems with function ca...
Raimund Kirner, Martin Schoeberl
WWW
2004
ACM
16 years 14 days ago
A semantic matchmaker service on the grid
A fundamental task on the Grid is to decide what jobs to run on what computing resources based on job or application requirements. Our previous work on ontology-based matchmaking ...
Andreas Harth, Stefan Decker, Yu He, Hongsuda Tang...
POPL
2008
ACM
16 years 3 days ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
15 years 12 months ago
GhostDB: querying visible and hidden data without leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...
CCS
2009
ACM
15 years 6 months ago
XCS: cross channel scripting and its impact on web applications
We study the security of embedded web servers used in consumer electronic devices, such as security cameras and photo frames, and for IT infrastructure, such as wireless access po...
Hristo Bojinov, Elie Bursztein, Dan Boneh