Sciweavers

1085 search results - page 188 / 217
» On the performance of one-to-many data transformations
Sort
View
LCTRTS
2007
Springer
15 years 7 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...
APGV
2006
ACM
181views Visualization» more  APGV 2006»
15 years 7 months ago
Categorization of natural scenes: local vs. global information
Understanding the robustness and rapidness of human scene categorization has been a focus of investigation in the cognitive sciences over the last decades. At the same time, progr...
Julia Vogel, Adrian Schwaninger, Christian Wallrav...
CASES
2006
ACM
15 years 7 months ago
Limitations of special-purpose instructions for similarity measurements in media SIMD extensions
Microprocessor vendors have provided special-purpose instructions such as psadbw and pdist to accelerate the sumof-absolute differences (SAD) similarity measurement. The usefulne...
Asadollah Shahbahrami, Ben H. H. Juurlink, Stamati...
CCS
2004
ACM
15 years 6 months ago
Payload attribution via hierarchical bloom filters
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...
Kulesh Shanmugasundaram, Hervé Brönnim...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 6 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu