Sciweavers

4074 search results - page 118 / 815
» Abstract Graph Transformation
Sort
View
TSP
2010
14 years 8 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
ICML
2009
IEEE
16 years 2 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
POPL
2002
ACM
16 years 2 months ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers
EMMCVPR
2009
Springer
15 years 8 months ago
Robust Segmentation by Cutting across a Stack of Gamma Transformed Images
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Medical image segmentation appears to be ...
Elena Bernardis, Stella X. Yu
CSDA
2010
124views more  CSDA 2010»
15 years 1 months ago
Statistical inference on attributed random graphs: Fusion of graph features and content
Abstract: Fusion of information from graph features and content can provide superior inference for an anomaly detection task, compared to the corresponding content-only or graph fe...
John Grothendieck, Carey E. Priebe, Allen L. Gorin