Sciweavers

746 search results - page 60 / 150
» Fast (Structured) Newton Computations
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 10 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CEC
2008
IEEE
14 years 4 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
JMIV
2007
122views more  JMIV 2007»
13 years 10 months ago
Fast Image Inpainting Based on Coherence Transport
High-quality image inpainting methods based on nonlinear higher-order partial differential equations have been developed in the last few years. These methods are iterative by natur...
Folkmar Bornemann, Tom März
PIMRC
2010
IEEE
13 years 8 months ago
Fast varying channel estimation in downlink LTE systems
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...
Youssef El Hajj Shehadeh, Serdar Sezginer
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 11 months ago
Graph Database Indexing Using Structured Graph Decomposition
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
David W. Williams, Jun Huan, Wei Wang 0010