Sciweavers

3630 search results - page 343 / 726
» Fast Marching Methods
Sort
View
IACR
2011
91views more  IACR 2011»
14 years 4 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
CSCWD
2008
Springer
15 years 6 months ago
CEBON: Collaborative estimation based on negotiation
: The Software Engineering community has been trying to get fast and accurate software estimations for many years. Most of the proposed methods require historical information and/o...
Fabian Poblete, José A. Pino, Sergio F. Och...
133
Voted
DSP
2007
15 years 5 months ago
Performance comparison between statistical-based and direct data domain STAPs
In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training d...
Santana Burintramart, Tapan K. Sarkar, Yu Zhang, M...
148
Voted
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 9 months ago
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
High efficiency in capacity utilization and fast restoration are two primary goals of survivable design in optical networks. Shared backup path protection has been shown to be effi...
Wensheng He, Arun K. Somani
205
Voted
CVPR
2012
IEEE
13 years 7 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang