Sciweavers

14 search results - page 3 / 3
» Complex Matrix Decomposition and Quadratic Programming
Sort
View
CVPR
2008
IEEE
13 years 11 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
CPAIOR
2009
Springer
13 years 12 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
TSP
2008
109views more  TSP 2008»
13 years 5 months ago
Code Design to Optimize Radar Detection Performance Under Accuracy and Similarity Constraints
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
TPDS
2008
124views more  TPDS 2008»
13 years 5 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque