# Rudy Raymond H.P.

## contact information

Doctor of Informatics

Tokyo Research Laboratory, Yamato, Japan

Tokyo Research Laboratory, Yamato, Japan

## links

**2016**

Bus Trajectory Identification by Map-Matching

Rudy Raymond and Takashi Imamichi

Rudy Raymond and Takashi Imamichi

*The 23rd International Conference on Pattern Recognition (ICPR) 2016 (accepted)*
Truncating Shortest Path Search for Efficient Map-Matching

Takashi Imamichi, Takayuki Osogami, and Rudy Raymond

Abstract

Takashi Imamichi, Takayuki Osogami, and Rudy Raymond

*The 25th International Joint Conference on Artificial Intelligence (IJCAI) 2016, 589:595*Abstract

**2015**

Crash Performance Prediction and Knowledge Discovery from Crash Simulation using Data Mining (in japanese)

Masatomo Ono, Yusuku Kageyama, Jun Iyama, Satoshi Hara, Tsuyoshi Ide, Rudy Raymond

Abstract

Masatomo Ono, Yusuku Kageyama, Jun Iyama, Satoshi Hara, Tsuyoshi Ide, Rudy Raymond

*Jidousha-GijutsuKai Aki Taikai*,*pp. 1236-1241*, 2015Abstract

Erratum to: Analysis of transient queues with semidefinite optimization

Takayuki Osogami, Rudy Raymond

Takayuki Osogami, Rudy Raymond

*Queueing Systems: Theory and Applications**80*(*4*), 387--388, JC Baltzer AG, Science Publishers, 2015**2014**

Efficient Policy Iteration for Periodic Markov Decision Process

Takayuki Osogami and Rudy Raymond

Abstract

Takayuki Osogami and Rudy Raymond

*ECAI 2014*,*pp. 1167 -- 1172*Abstract

An Approximate Counting for Big Textual Data Streams

Rudy Raymond, Teruo Koyanagi, and Takayuki Osogami

Rudy Raymond, Teruo Koyanagi, and Takayuki Osogami

*21st European Conference on Artificial Intelligence (ECAI 2014)*,*pp. 1085-1086*
A multi-objective genetic algorithm using intermediate features of simulations

Hidemasa Muta, Rudy Raymond, Satoshi Hara, Tetsuro Morimura

Abstract

Hidemasa Muta, Rudy Raymond, Satoshi Hara, Tetsuro Morimura

*Simulation Conference (WSC), 2014 Winter*,*pp. 793--804*Abstract

Predicting halfway through simulation: Early scenario evaluation using intermediate features of agent-based simulations

Satoshi Hara, Rudy Raymond, Tetsuro Morimura, Hidemasa Muta

Abstract

Satoshi Hara, Rudy Raymond, Tetsuro Morimura, Hidemasa Muta

*Simulation Conference (WSC), 2014 Winter*,*pp. 334--343b*Abstract

**2013**

Analysis of transient queues with semidefinite optimization

Takayuki Osogami, Rudy Raymond

Abstract

Takayuki Osogami, Rudy Raymond

*Queueing Systems**73*(*2*), 195--234, Springer, 2013Abstract

Simple and fast trip generation for large scale traffic simulation

Takashi Imamichi, Rudy Raymond

Abstract

Takashi Imamichi, Rudy Raymond

*Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World*,*pp. 2020--2031*Abstract

Dependable virtual machine allocation

Hiroki Yanagisawa, Takayuki Osogami, Rudy Raymond

Abstract

Hiroki Yanagisawa, Takayuki Osogami, Rudy Raymond

*INFOCOM, 2013 Proceedings IEEE*,*pp. 629--637*Abstract

Map Matching with Inverse Reinforcement Learning.

Takayuki Osogami, Rudy Raymond

Abstract

Takayuki Osogami, Rudy Raymond

*IJCAI*, 2013Abstract

**2012**

Sensor Data Analytics to Complement Sparse and Incomplete Medical Records for Diabetes Disease Management

Rudy Raymond, Naoki Nakashima, Yasunobu Nohara and Sozo Inoue

Rudy Raymond, Naoki Nakashima, Yasunobu Nohara and Sozo Inoue

*International Workshop on Pattern Recognition for Healthcare Analytics*, IAPR, 2012
User community reconstruction using sampled microblogging data

Miki Enoki, Yohei Ikawa, Raymond Rudy

Abstract

Miki Enoki, Yohei Ikawa, Raymond Rudy

*Proceedings of the 21st international conference companion on World Wide Web*,*pp. 657--660*, 2012Abstract

Map matching with hidden Markov model on sampled road network

Rudy Raymond, Tetsuro Morimura, Takayuki Osogami, Noriaki Hirosue

Abstract

Rudy Raymond, Tetsuro Morimura, Takayuki Osogami, Noriaki Hirosue

*2012 21st International Conference on Pattern Recognition (ICPR 2012)*,*pp. 2242--2245*Abstract

**2011**

Simple bounds for a transient queue

Takayuki Osogami, Rudy Raymond

Abstract

Takayuki Osogami, Rudy Raymond

*2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN)*,*pp. 562--573*Abstract

Location recommendation based on location history and spatio-temporal correlations for an on-demand bus system

Rudy Raymond, Takamitsu Sugiura, Kota Tsubouchi

Abstract

Rudy Raymond, Takamitsu Sugiura, Kota Tsubouchi

*Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems*,*pp. 377--380*, 2011Abstract

**2010**

Proximity in skewed bipartite graphs with unsupervised auxiliary information

Rudy Raymond, Hisashi Kashima

2010

Rudy Raymond, Hisashi Kashima

2010

Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs

Rudy Raymond, Hisashi Kashima

Abstract

Rudy Raymond, Hisashi Kashima

*Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2010)*,*pp. 131--147*, SpringerAbstract

Semidefinite optimization for analysis of queues in closed forms

Takayuki Osogami, Rudy Raymond

Technical Report, Technical Report RT0896, IBM Research--Tokyo, March, 2010

Takayuki Osogami, Rudy Raymond

Technical Report, Technical Report RT0896, IBM Research--Tokyo, March, 2010

Semidefinite optimization for transient analysis of queues

Takayuki Osogami, Rudy Raymond

Abstract

Takayuki Osogami, Rudy Raymond

*ACM SIGMETRICS Performance Evaluation Review*,*pp. 363--364*, 2010Abstract

Quantum counterfeit coin problems

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama

Abstract

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama

*Algorithms and Computation (ISAAC 2010)*,*pp. 85--96*, SpringerAbstract

Support or oppose?: classifying positions in online debates from reply activities and opinion expressions

Akiko Murakami, Rudy Raymond

Abstract

Akiko Murakami, Rudy Raymond

*Proceedings of the 23rd International Conference on Computational Linguistics: Posters (COLING 2010)*,*pp. 869--875*Abstract

**2009**

Average/Worst-Case Gap of Quantum Query Complexities

A. Andris, I. Kazuo, N. Masaki, N. Harumichi, R. Rudy, T. Seiichiro, Y. Shigeru

A. Andris, I. Kazuo, N. Masaki, N. Harumichi, R. Rudy, T. Seiichiro, Y. Shigeru

*情報処理学会研究報告. AL, アルゴリズム研究会報告**2009*(*8*), 1--7, 一般社団法人情報処理学会
Average/Worst-Case Gap of Quantum Query Complexities (アルゴリズム (AL) Vol. 2009-AL-124)

Ambainis Andris, Iwama Kazuo, Nakanishi Masaki, Nishimura Harumichi, Raymond Rudy, Tani Seiichiro, Yamashita Shigeru

Ambainis Andris, Iwama Kazuo, Nakanishi Masaki, Nishimura Harumichi, Raymond Rudy, Tani Seiichiro, Yamashita Shigeru

*研究報告アルゴリズム (AL)**2009*(*8*), 1--7, 情報処理学会
Quantum Random Access Coding

Harumichi Nishimura, Rudy Raymond

Harumichi Nishimura, Rudy Raymond

*IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences**92*(*5*), 1268--1275, The Institute of Electronics, Information and Communication Engineers, 2009
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

*arXiv preprint arXiv:0908.2468*, 2009**2008**

Unbounded-error quantum query complexity

Ashley Montanaro, Harumichi Nishimura, Rudy Raymond

Abstract

Ashley Montanaro, Harumichi Nishimura, Rudy Raymond

*Algorithms and Computation (ISAAC 2008)*,*pp. 919--930*, SpringerAbstract

Quantum query complexity of boolean functions with small on-sets

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita

*Algorithms and Computation (ISAAC 2008)*,*pp. 907--918*, Springer
Polynomial-time construction of linear network coding

Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita

Abstract

Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita

*Automata, Languages and Programming (ICALP 2008)*,*pp. 271--282*, SpringerAbstract

**2007**

Unbounded error quantum query complexity

Ashley Montanaro, Harumichi Nishimura, Rudy Raymond

Ashley Montanaro, Harumichi Nishimura, Rudy Raymond

*arXiv preprint arXiv:0712.1446*, 2007
Sensitivity analysis on causal events of wip bubbles by a log-driven simulator

Ryo Hirade, Rudy Raymond, Hiroyuki Okano

Ryo Hirade, Rudy Raymond, Hiroyuki Okano

*Simulation Conference, 2007 Winter*,*pp. 1747--1754*
Unbounded-error one-way classical and quantum communication complexity

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

*Automata, Languages and Programming*,*pp. 110--121*, Springer, 2007
Unbounded-error classical and quantum communication complexity

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

*Algorithms and Computation*,*pp. 100--111*, Springer, 2007
Improved algorithms for quantum identification of Boolean oracles

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

*Theoretical computer science**378*(*1*), 41--53, Elsevier, 2007
Quantum network coding

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

*STACS 2007*,*pp. 610--621*, Springer**2006**

Studies on quantum query complexities and quantum network coding

Rudy Raymond Harry Putra

2006 - repository.kulib.kyoto-u.ac.jp, Kyoto University

Rudy Raymond Harry Putra

2006 - repository.kulib.kyoto-u.ac.jp, Kyoto University

Quantum Identification of Boolean Oracles

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

*Quantum Computation and Information*,*pp. 3--18*, Springer, 2006
Query Complexity of Quantum Biased Oracles

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

*Quantum Computation and Information*,*pp. 19--42*, Springer, 2006
(4, 1)-Quantum random access coding does not exist—one qubit is not enough to recover one of four bits

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

*New Journal of Physics**8*(*8*), 129, IOP Publishing, 2006
Quantum network coding for general graphs

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita

*arXiv preprint quant-ph/0611039*, 2006**2005**

General Bounds for Quantum Biased Oracles (特集: 量子計算と量子情報)

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

*情報処理学会論文誌**46*(*10*), 2481--2491, 一般社団法人情報処理学会, 2005
General bounds for quantum biased oracles

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

Kazuo Iwama, Rudy Raymond, Shigeru Yamashita

*IPSJ Digital Courier**1*, 415--425, Information Processing Society of Japan, 2005**2004**

Robust quantum algorithms for oracle identification

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita

*arXiv preprint quant-ph/0411204*, 2004**2002**

Exploiting the difference in probability calculation between quantum and probabilistic computations

Masami Amano, Kazuo Iwama, Rudy Raymond

Masami Amano, Kazuo Iwama, Rudy Raymond

*Unconventional Models of Computation*,*pp. 100--114*, Springer, 2002