87 search results - page 17 / 18 » Latency Minimization for Synchronous Data Flow Graphs |
168
click to vote
SIGOPS
2010
15 years 3 months ago
2010
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
172
click to vote
CLOUD
2010
ACM
15 years 10 months ago
2010
ACM
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...
250
click to vote
ITCC
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
166
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 5 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
267
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
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...