Result for "Algorithm",544
Efficient Algorithm for Anchor Graph Hashing | NTT Communication Science Laboratories | NTT R&D Website
Efficient Algorithm for Anchor Graph Hashing | NTT Communication Science Laboratories | NTT R&D
https://www.rd.ntt/e/cs/team_project/media/recognition/research_media17.html
Quantum Algorithms with Potential for New Applications | NTT R&D Website
Applications quantum algorithm hash function NP problem This article outlines a new algorithm devised by NTT
https://www.rd.ntt/e/research/JN202305_21863.html
0110.pdf
A MODIFICATION OF THE GRADIENT ALGORITHM FOR BLIND SIGNAL SEPARATION Hyung-Min Park Brain Science
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0110.pdf
Proceedings of the IASTED International Conference
speakers talk simultaneously. The conventional adaptive digital FIR filter using algorithm such as LMS
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0027.pdf
paper_new4.dvi
operating system (Windows OS) is presented. In this approach, hardware and algorithm related programming
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0015.pdf
PowerPoint Presentation
used to give a 1 2 -approximation algorithm for the densest subgraph problem, and a 1 3 -approximation
https://www.rd.ntt/_assets/pdf/sic/event/2017/70/01-yu.pdf
0035.pdf
introduced to the equilib- rium point, and a new unsymmetrical natural gradient algorithm is proposed, which
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0035.pdf
Fast mining of relationships of large-scale data - An efficient algorithm for L1-graph construction -｜NTT R&D Website
Fast mining of relationships of large-scale data - An efficient algorithm for L1-graph
https://www.rd.ntt/e/research/KLC20210403.html
poster_en.pdf
algorithm adapts learning rate by using directions of past gradients. This approach gives 2 to 5 times fewer
https://www.rd.ntt/cs/event/openhouse/2016/exhibition/7/poster_en.pdf
iwaenc03.dvi
-reuse adaptive algorithm is to improve the conver- gence rate of the initial algorithm. We show, in
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0024.pdf
0099.pdf
LINEAR MULTILAYER ICA ALGORITHM INTEGRATING SMALL LOCAL MODULES Yoshitatsu Matsuda and Kazunori
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0099.pdf
スライド 1
Learning and finding congestion-free routes - Online shortest path algorithm with binary decision diagrams
https://www.rd.ntt/cs/event/openhouse/2019/download/01_a_en.pdf
0022.pdf
a blockwise batch algorithm in the first stage, and the separated signals are refined by post
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0022.pdf
Newton03.dvi
exhibit an interesting relation- ship with the natural gradient algorithm for blind decorre- lation and
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0158.pdf
Extracting Quantum Power by Using Algorithms and Their Verification | NTT R&D Website
Extracting Quantum Power by Using Algorithms and Their Verification quantum computer quantum algorithm
https://www.rd.ntt/e/research/JN202304_21634.html
Microsoft Word - ICA2003 - Versi.n Enviada y Revisada.doc
the unknown sources. The principles of the new method and a description of the algorithm followed by
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0079.pdf
D:\Ivica_Kopriva\My Papers\ICA2003\Szu_Kopriva.pdf.pdf
problem on the pixel by pixel basis. Consequently, algorithm is capable to solve the space variant
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0013.pdf
cross.dvi
-moment in linear blind source separation (BSS) is considered. The algorithm is similar to the FastICA
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0038.pdf
NTT Communication Science Laboratories Open House 2018
decision diagrams Abstract We show an optimization algorithm that can automatically find the positions to
https://www.rd.ntt/cs/event/openhouse/2018/exhibition/9/index_en.html
Efficient Algorithm for K-Multiple-Means | NTT Communication Science Laboratories | NTT R&D Website
Efficient Algorithm for K-Multiple-Means | NTT Communication Science Laboratories | NTT R&D
https://www.rd.ntt/e/cs/team_project/media/recognition/research_media24.html
スライド 1
. This successive update algorithm allows users to always search with the most current data. [1] K
https://www.rd.ntt/cs/event/openhouse/2018/exhibition/1/poster_en_1.pdf
0090.pdf
FREQUENCY DOMAIN REALIZATION OF A MULTICHANNEL BLIND DECONVOLUTION ALGORITHM BASED ON THE NATURAL
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0090.pdf
ica03.dvi
. Consequently, a source sep- aration algorithm can be designed based on the minimiza- tion of the mutual
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0131.pdf
0143.pdf
Engineering, Kyushu Institute of Technology, Japan Abstract This paper addresses an algorithm for independent
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0143.pdf
ica03wiener.dvi
ABSTRACT In this paper, a new algorithm for blind inversion of Wiener systems is presented. The algorithm
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0132.pdf
poster_en_6.pdf
developed an efficient algorithm to construct L1-graph from large size of data. We reduce the computation
https://www.rd.ntt/cs/event/openhouse/2017/exhibition/6/poster_en_6.pdf
0018.pdf
PROPORTIONATE NLMS ALGORITHM FOR SECOND-ORDER VOLTERRA FILTERS AND ITS APPLICATION TO NONLINEAR
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0018.pdf
Microsoft Word - ica2003_aica_fin.doc
a new ICA algorithm that exploits algebraic operations and vector- distance measures to estimate the
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0147.pdf
Microsoft Word - FRT_based_BSS_v19.doc
as special cases in that framework. We further suggest a new algorithm that is based on the
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0111.pdf
lsdiag.dvi
lsdiag.dvi A LINEAR LEAST-SQUARES ALGORITHM FOR JOINT DIAGONALIZATION Andreas Ziehe†, Pavel Laskov
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0169.pdf
NTT Communication Science Laboratories Open House 2016
access logs and sensor data. Presented here is a novel search algorithm that takes advantages of state-of
https://www.rd.ntt/cs/event/openhouse/2016/exhibition/9/index_en.html
C:\RIKEN\NARA_C~1.dvi
C:\RIKEN\NARA_C~1.dvi AN ONLINE ALGORITHM FOR BLIND EXTRACTION OF SOURCES WITH DIFFERENT DYNAMICAL
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0188.pdf
0086.pdf
algorithm (FastTe- ICA) which is similar to the well known FastICA algo- rithm introduced by Hyvärinen
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0086.pdf
ica2003_revise.doc
filtering. Based on this method we present a novel algorithm for real-time blind source separation of
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0023.pdf
Selective Vehicle-data-collection Algorithm | NTT R&D Website
Selective Vehicle-data-collection Algorithm | NTT R&D Website NTT R&D Website Research&Activity
https://www.rd.ntt/e/research/JN202205_18185.html
fastgeoovercomplete_ica2003.dvi
fastgeoovercomplete_ica2003.dvi A HISTOGRAM-BASED OVERCOMPLETE ICA ALGORITHM Fabian J. Theis1
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0089.pdf
poster_en.pdf
access logs and sensor data. Presented here is a novel search algorithm that takes advantages of state-of
https://www.rd.ntt/cs/event/openhouse/2016/exhibition/9/poster_en.pdf
スライド 1
optimization algorithm that can automatically find the positions to add links to infrastructure networks
https://www.rd.ntt/cs/event/openhouse/2018/exhibition/9/poster_en_9.pdf
0079.pdf
be maintained thanks to efficient realizations. The algorithm allows a tradeoff between the well
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0079.pdf
スライド 1
nodes Asynchronous consensus algorithm on distributed networks While use of massive data benefits on
https://www.rd.ntt/cs/event/openhouse/2020/download/c_20_en.pdf
Next-generation Data Hub Technology for a Data-centric Society through High-quality High-reliability Data Distribution｜NTT R&D Website
expertise (i.e., for creating an algorithm for giving data value) circulate beyond the borders of an
https://www.rd.ntt/e/research/JN202012_8905.html
0072.pdf
, maki}@cslab.kecl.ntt.co.jp ABSTRACT In this paper we propose a time-domain gradient algorithm that ex
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0072.pdf
0054.pdf
]@kcl.ac.uk ABSTRACT A joint diagonalization algorithm for convolutive blind source separation by
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0054.pdf
0097.pdf
Problem 3.2). Algorithm 1 (Steepest descent method for Problem 3.4) Choose U (t) 0 ∈ O(N) \ E (t = 1, 2
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0097.pdf
0034.pdf
AN ALGORITHM FOR CANCELLATION OF SIDETONE OSCILLATIONS Martin Schönle, Virginie Gilg Siemens AG
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0034.pdf
0128.pdf
separation is achieved by entropy maximization using the natural gradient algorithm. The undesired temporal
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0128.pdf
NTT Communication Science Laboratories Open House 2017
Exhibition Program 6 Fast mining of relationships of large-scale data An efficient algorithm for L1-graph
https://www.rd.ntt/cs/event/openhouse/2017/exhibition/6/index_en.html
poster_en3.pdf
), 2012. [2] H. Shiokawa, Y. Fujiwara, M. Onizuka, “Fast Algorithm for Modularity-based Graph Clustering
https://www.rd.ntt/cs/event/openhouse/2013/exhibition/bigdata4/poster_en3.pdf
0042.pdf
223-8522, Japan Abstract Fully adaptive feedforward control algorithm is proposed for general multi
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0042.pdf
Abstracts of all papers, ICA2003
PCA' algorithm which is a special case of the nonlinear PCA algorithm, but with a rectification
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/abst.html
paper0048.dvi
) based contrasts. In this algorithm we adaptively compute a mo- ment matrix, an estimate of some fourth
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0048.pdf
0054.pdf
method is an algorithm that calculates an estima- tion of gradient vector by adding a little perturbation
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0054.pdf
Microsoft Word - 3E3495A9-54B4-18FBD3.doc
Microsoft Word - 3E3495A9-54B4-18FBD3.doc A FIXED-POINT ICA ALGORITHM FOR CONVOLUTED SPEECH SIGNAL
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0082.pdf
0043.pdf
STABLE LEARNING ALGORITHM FOR BLIND SEPARATION OF TEMPORALLY CORRELATED SIGNALS COMBINING
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0043.pdf
Abstracts of all papers, ICA2003
`Non-Negative PCA' algorithm which is a special case of the nonlinear PCA algorithm, but with a
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/abst.htm
ica2003_Jordi_Christian2.dvi
ica2003_Jordi_Christian2.dvi IMPROVING ALGORITHM SPEED IN PNL MIXTURE SEPARATION AND WIENER SYSTEM
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0077.pdf
0063.pdf
TRINI- CON algorithm (’Triple-N ICA for convolutive mixtures’). This is done by introducing an
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0063.pdf
0011.pdf
filtered-reference algorithm in the noise-control pro- cess. The theoretical considerations are confirmed
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0011.pdf
Microsoft Word - ICA2003_novel_algorithm_columnXXXXXX.doc
Microsoft Word - ICA2003_novel_algorithm_columnXXXXXX.doc DECORRELATION-BASED BLIND SOURCE
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0001.pdf
0062.pdf
TWO-PHASE NONPARAMETRIC ICA ALGORITHM FOR BLIND SEPARATION OF INSTANTANEOUS LINEAR MIXTURES Chin
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0062.pdf
ica2003_gau2.dvi
Expecta- tion (ACE) algorithm to approximately invert the (post-)non- linear functions. In this
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0208.pdf
paper0047.dvi
. Experiments have been included to show that this algorithm have an excellent performance at a low computa
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0047.pdf
0055.pdf
linear microphone array. For this study we choose our frequency domain fixed-point ICA algorithm, based
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0055.pdf
0035.pdf
param- eters wm, m = 0, . . . , M − 1. According to [1] the normalized LMS algorithm has become the de
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0035.pdf
op-ica03.dvi
region of zero. We propose the use of a ‘Non-Negative PCA’ algorithm which is a special case of the
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0094.pdf
0194.pdf
obtained by using linear programming algorithm. The basis matrix can be estimated using gradient type
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0194.pdf
Towards Reliable Infrastructures with Compressed Computation | NTT R&D Website
graph theory. 3. Infrastructure analysis by compressed computation 3.1 Infrastructure-design algorithm
https://www.rd.ntt/e/research/JN202409_29259.html
poster_en.pdf
.Fujiwara, M.Onizuka, “SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale
https://www.rd.ntt/cs/event/openhouse/2015/exhibition/5/poster_en.pdf
Network Reliability Design and Control Technology for Robust Networks | NTT R&D Website
design in transport network. Many algorithms, such as Dijkstra's algorithm, for finding the shortest
https://www.rd.ntt/e/research/JN202310_23444.html
0064.pdf
- channel frequency-domain algorithm exhibiting RLS-like conver- gence. For the computation of this
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0064.pdf
nonlineargeo_ica2003.dvi
new algorithm for nonlinear blind source sepa- ration, which is based on the geometry of the mixture
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0206.pdf
0053.pdf
spectra in 3D chem- ical shift imaging (CSI). The method is based on the NMF algorithm of Lee and Seung [1
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0053.pdf
NTT Communication Science Laboratories Open House 2019
Learning and finding congestion-free routes - Online shortest path algorithm with binary decision diagrams
https://www.rd.ntt/cs/event/openhouse/2019/exhibition1/index_en.html
poster_en.pdf
will help to improve the effectiveness of future applications. Fast algorithm for graph clustering [2
https://www.rd.ntt/cs/event/openhouse/2014/exhibition/3/poster_en.pdf
ica03.dvi
://myhome.naver.com/flyers ABSTRACT Binaural blind source separation algorithm for noisy mix- tures is
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0156.pdf
0136.pdf
algorithm for the problem of multi-channel blind deconvolution which can adapt to un- known sources with
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0136.pdf
no_24_en.pdf
quantum search algorithm from the viewpoint of temporal analogue of “nonlocality” between different
https://www.rd.ntt/brl/event/splaza2009/poster/EN/no_24_en.pdf
Microsoft Word - Paper__Reviewers_4.doc
surface EMG into MUAP trains. We used the fast fixed-point algorithm for ICA developed by Hyvärinen and
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0144.pdf
0067.pdf
.jp Abstract: An algorithm of blind source separation is applied to mixture of eight voices taken in
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0067.pdf
0017.pdf
paper, a system architecture and its adaptive algorithm for feedforward ANC system are presented. The
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0017.pdf
kalman.dvi
ap- proaches differ only by the choice of the algorithm used to estimate model parameters and the
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0012.pdf
NTT Communication Science Laboratories Open House 2016
overcome this problem, we have developed efficient training algorithms for Deep Learning. Our algorithm
https://www.rd.ntt/cs/event/openhouse/2016/exhibition/7/index_en.html
0033.pdf
banded property is incorpo- rated into the ICA algorithm as prior information, giving rise to a banded
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0033.pdf
Statistical document summarization technology｜NTT R&D Website
"tree knapsack problem," we have also devised an algorithm to solve efficiently. Background / Issues In
https://www.rd.ntt/e/research/CS0026.html
WPE speech dereverberation
algorithm. Please refer to the license file for details. Please cite the following paper when you publish
https://www.rd.ntt/cs/team_project/media/signal/wpe/
AN EFFICIENT FUNCTIONAL LINK NEURAL NETWORK FOR ACTIVE CONTROL OF NONLINEAR NOISE PROCESSES
– There are several situations where the conventional ANC using FXLMS algorithm does not perform
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0080.pdf
A Method for Digital Image Watermarking Using ICA
employ the fast fixed-point algorithm, FastICA, to deal with the problem of detection and blind
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0036.pdf
0174.pdf
Infomax algorithm of Bell and Se- jnowski [16]. Girolami [13] also uses the ML approach, but employs a
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0174.pdf
Next-generation Data Hub for Secure and Convenient Data Utilization across Organizational Boundaries | NTT R&D Website
distributed and the track record of their use. Data or data-analysis-algorithm providers are also especially
https://www.rd.ntt/e/research/JN202202_17186.html
iwaenc2003_2.dvi
decomposition of stereo audio signals with a matching pursuit type algorithm and found the parameters of the
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0052.pdf
0084.pdf
some particular aspects which are characteristic of sounds signal processing. (1) On-line algorithm In
https://www.rd.ntt/cs/team_project/icl/signal/iwaenc03/cdrom/data/0084.pdf
Yu Sasaki | NTT R&D Website
standardized algorithms. In this page Awards SCIS 2007 Paper Award "New Differential Path Search Algorithm for
https://www.rd.ntt/e/organization/researcher/special/s_019.html
The Trichromatic Lottery Ticket Hypothesis | NTT Communication Science Laboratories | NTT R&D Website
algorithm–hardware co-design for energy efficiency. Publications Á. López García-Arias, Y. Okoshi, H. Otsuka
https://www.rd.ntt/e/cs/team_project/media/recognition/research_media23.html
0081.pdf
transmitter sends a training se- quence, the filter coefficients can be easily adapted using the LMS algorithm
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0081.pdf
C:\A.Tonazzini\Lavori\Lavori_in_corso\ICA_2003\ica2003#2.dvi
estimation method and derive a general algorithm for recovering both the mixing matrix and the sources, based
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0071.pdf
ica2003icalab.dvi
this assumption with other com- mon source assumptions, we derive a demixing algorithm for noisy
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0167.pdf
D01-16-e.pdf
combining an algorithm that understands the question and searches for the most appropriate information with
https://www.rd.ntt/forum/2024/doc/D01-16-e.pdf
Keynote speech
Presented by Simon Haykin, McMaster University, Canada Abstract We describe a novel algorithm, called
https://www.rd.ntt/cs/team_project/icl/signal/waspaa2007/keynote_addresses.html
Reliable and Distributed Media Processing Technology based on Secured Sparse Coding｜NTT R&D Website
signals). The learning process of sparse coding can be accomplished using K-SVD algorithm, and the testing
https://www.rd.ntt/e/research/NI0061.html
0084.pdf
algorithm for the independent components analysis (ICA) problem based on efficient spac- ings estimates of
https://www.rd.ntt/cs/team_project/icl/signal/ica2003/cdrom/data/0084.pdf