default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyuichi Hirabayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c13]Rika Ito, Ryuichi Hirabayashi:
Optimal design of FIR filter with SP2 coefficients based on semi-infinite linear programming method. EUSIPCO 2006: 1-5- 2005
- [j5]Masafumi Ito, Ryuichi Hirabayashi:
Initial ideals of unimodular integer programs. Int. J. Comput. Math. 82(12): 1429-1445 (2005) - 2004
- [c12]Rika Ito, Tetsuya Fujie, Kenji Suyama, Ryuichi Hirabayashi:
A powers-of-two term allocation algorithm for designing FIR filters with CSD coefficients in a min-max sense. EUSIPCO 2004: 987-990 - 2003
- [j4]Masafumi Ito, Ryuichi Hirabayashi:
Computing test sets for integer programming. Optim. Methods Softw. 18(4): 437-452 (2003) - [c11]Tetsuya Fujie, Rika Ito, Kenji Suyama, Ryuichi Hirabayashi:
A new heuristic signed-power of two term allocation approach for designing of FIR filters. ISCAS (4) 2003: 285-288 - 2002
- [c10]Rika Ito, Tetsuya Fujie, Kenji Suyama, Ryuichi Hirabayashi:
New design method of fir filters with SP2 coefficients based on a new linear programming relaxation with triangle inequalities. EUSIPCO 2002: 1-4 - [c9]Kenji Suyama, Ken'ichi Takada, Ryuichi Hirabayashi, Hiroshi Iwakura:
Optimal design of fir filters in complex Chebyshev sense using semi-infinite programming method. ICASSP 2002: 3140-3143 - [c8]Rika Ito, Tetsuya Fujie, Kenji Suyama, Ryuichi Hirabayashi:
New design methods of FIR filters with signed power of two coefficients based on a new linear programming relaxation with triangle inequalities. ISCAS (1) 2002: 813-816 - 2001
- [c7]Rika Ito, Kenji Suyama, Ryuichi Hirabayashi:
Optimal design method for FIR filter with discrete coefficients based on integer semi-infinite linear programs. ICASSP 2001: 3805-3808 - [c6]Rika Ito, Kenji Suyama, Ryuichi Hirabayashi:
Optimal design of FIR filter with discrete coefficients based on integer semi-infinite linear programs. ISCAS (2) 2001: 629-632 - 2000
- [c5]Kenji Suyama, Ryuichi Hirabayashi:
A learning algorithm for adaptive microphone arrays based on mathematical programming methods. ICASSP 2000: 861-864
1990 – 1999
- 1998
- [c4]Yuji Shinano, Tetsuya Fujie, Yoshiko Ikebe, Ryuichi Hirabayashi:
Solving the Maximum Clique Problem Using PUBB. IPPS/SPDP 1998: 326-332 - 1997
- [c3]Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi:
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms. IPPS 1997: 621- - 1996
- [c2]Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi:
An Interface Design for General Parallel Branch-and-Bound Algorithms. IRREGULAR 1996: 277-284 - 1995
- [c1]Yuji Shinano, Masahiro Higaki, Ryuichi Hirabayashi:
A generalized utility for parallel branch and bound algorithms. SPDP 1995: 392-401 - 1994
- [j3]Harald Günzel, Ryuichi Hirabayashi, Hubertus Th. Jongen, Susumu Shindoh:
On the topological complexity of DC-sets. J. Glob. Optim. 4(3): 279-284 (1994) - [j2]Ryuichi Hirabayashi, Hubertus Th. Jongen, Masayuki Shida:
Stability for linearly constrained optimization problems. Math. Program. 66: 351-360 (1994) - 1993
- [j1]Ryuichi Hirabayashi, Masayuki Shida, Susumu Shindoh:
Manifold Structure of the Karush-Kuhn-Tucker Stationary Solution Set with Two Parameters. SIAM J. Optim. 3(3): 564-581 (1993)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
