Vesa Välimäki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Antti Kelloniemi

> Home > Persons > Vesa Välimäki

Publications

2006
[c56]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/KelloniemiVS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/KelloniemiVS06
Antti Kelloniemi, Vesa Välimäki, Lauri Savioja:
Simulation of Room Acoustics using 2-D Digital Waveguide Meshes. ICASSP (5) 2006: 313-316
2005
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/spl/KelloniemiSV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/spl/KelloniemiSV05
Antti Kelloniemi, Lauri Savioja, Vesa Välimäki:
Spatial filter-based absorbing boundary for the 2-D digital waveguide mesh. IEEE Signal Process. Lett. 12(2): 126-129 (2005)
[c55]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/eusipco/KelloniemiVHS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/KelloniemiVHS05
Antti Kelloniemi, Vesa Välimäki, Patty Huang, Lauri Savioja:
Artificial reverberation using a hyper-dimensional FDTD mesh. EUSIPCO 2005: 1-4
2004
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/KelloniemiMSV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/KelloniemiMSV04
Antti Kelloniemi, Damian T. Murphy, Lauri Savioja, Vesa Välimäki:
Boundary conditions in a multi-dimensional digital waveguide mesh. ICASSP (4) 2004: 25-28

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.