Sciweavers

3913 search results - page 718 / 783
» complexity 2006
Sort
View
IDTRUST
2009
ACM
14 years 4 months ago
Usable trust anchor management
Security in browsers is based upon users trusting a set of root Certificate Authorities (called Trust Anchors) which they may know little or nothing about. Browser vendors face a...
Massimiliano Pala, Scott A. Rea
CC
2009
Springer
106views System Software» more  CC 2009»
14 years 4 months ago
Blind Optimization for Exploiting Hardware Features
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
Dan Knights, Todd Mytkowicz, Peter F. Sweeney, Mic...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 4 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
ISORC
2009
IEEE
14 years 4 months ago
Adding Timing-Awareness to AUTOSAR Basic-Software -- A Component Based Approach
AUTOSAR as specified in its current version fosters timing-constraints at application level to support the development of real-time automotive applications. However, the standard...
Dietmar Schreiner, Markus Schordan, Jens Knoop
CP
2007
Springer
14 years 4 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner