Sciweavers

1028 search results - page 190 / 206
» Using Attack Graphs to Design Systems
Sort
View
107
Voted
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
15 years 11 months ago
A data mining approach to modeling relationships among categories in image collection
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...
Ruofei Zhang, Zhongfei (Mark) Zhang, Sandeep Khanz...
POPL
2003
ACM
15 years 11 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
CLOUD
2010
ACM
15 years 4 months ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
15 years 4 months ago
Functional Coverage Driven Test Generation for Validation of Pipelined Processors
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
Prabhat Mishra, Nikil D. Dutt
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 4 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre