Sciweavers

2516 search results - page 446 / 504
» When is there a representer theorem
Sort
View
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
15 years 10 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
FQAS
1998
Springer
118views Database» more  FQAS 1998»
15 years 10 months ago
Partial Answers for Unavailable Data Sources
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...
Philippe Bonnet, Anthony Tomasic
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
CCS
2006
ACM
15 years 10 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
ISMIS
2000
Springer
15 years 9 months ago
An Intelligent Lessons Learned Process
A learned lesson, in the context of a pre-defined organizational process, summarizes an experience that should be used to modify that process, under the conditions for which that l...
Rosina Weber, David W. Aha, Héctor Mu&ntild...