• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

• 2021
• 
  Junhao Zhang, Masafumi Kazuno, Mizuki Motoyoshi, Suguru Kameda, Noriharu Suematsu:
  Image Enhancement in 26GHz-Band 1-Bit Direct Digital RF Transmitter Using Manchester Coding. IEICE Trans. Commun. 104-B(6): 654-663 (2021)
• 2016
• 
  Tsunehiko Kameda, Ichiro Suzuki, Masafumi Yamashita:
  An alternative proof for the equivalence of ∞-searcher and 2-searcher. Theor. Comput. Sci. 634: 108-119 (2016)
• 2014
• 
  Hidemi Kamezawa, Katsutoshi Shirieda, Hidetaka Arimura, Noboru Kameda, Masafumi Ohki:
  An approach of exposure dose reduction of cone-beam computed tomography in an image guided patient positioning system by using various noise suppression filters. SCIS&ISIS 2014: 1475-1780
• 2007
• 
  Toshiro Noritsugu, Daisuke Sasaki, Masafumi Kameda, Atsushi Fukunaga, Masahiro Takaiwa:
  Wearable Power Assist Device for Standing Up Motion Using Pneumatic Rubber Artificial Muscles. J. Robotics Mechatronics 19(6): 619-628 (2007)
• 2006
• 
  Tsunehiko Kameda, Masafumi Yamashita, Ichiro Suzuki:
  Online polygon search by a seven-state boundary 1-searcher. IEEE Trans. Robotics 22(3): 446-460 (2006)
• 
  Tsunehiko Kameda, John Z. Zhang, Masafumi Yamashita:
  Characterization of Polygons Searchable by a Boundary 1-Searcher. CCCG 2006
• 2004
• 
  Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda:
  Searching a polygonal region by a group of stationary k-searchers. Inf. Process. Lett. 92(1): 1-8 (2004)
• 2002
• 
  Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
  Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002)
• 2001
• 
  Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers. Algorithmica 31(2): 208-236 (2001)
• 
  Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda:
  Searching a Polygonal Region from the Boundary. Int. J. Comput. Geom. Appl. 11(5): 529-553 (2001)
• 2000
• 
  Satoshi Fujita, Masafumi Yamashita, Tiko Kameda:
  A Study on r-Configurations - A Resource Assignment Problem on Graphs. SIAM J. Discret. Math. 13(2): 227-254 (2000)
• 
  Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
  Max- and Min-Neighborhood Monopolies. SWAT 2000: 513-526
• 1999
• 
  Masafumi Yamashita, Tsunehiko Kameda:
  Modeling K-coteries by well-covered graphs. Networks 34(3): 221-228 (1999)
• 
  Masafumi Yamashita, Tsunehiko Kameda:
  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. 10(9): 878-887 (1999)
• 1998
• 
  Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda:
  Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon. Inf. Process. Lett. 66(1): 49-52 (1998)
• 1997
• 
  Masafumi Yamashita, Hideki Umemoto, Ichiro Suzuki, Tsunehiko Kameda:
  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract). SCG 1997: 448-450
• 1996
• 
  Masafumi Yamashita, Tiko Kameda:
  Computing Functions on Asynchronous Anonymous Networks. Math. Syst. Theory 29(4): 331-356 (1996)
• 
  Masafumi Yamashita, Tsunehiko Kameda:
  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases. IEEE Trans. Parallel Distributed Syst. 7(1): 69-89 (1996)
• 
  Masafumi Yamashita, Tsunehiko Kameda:
  Computing on Anonymous Networks: Part II-Decision and Membership Problems. IEEE Trans. Parallel Distributed Syst. 7(1): 90-96 (1996)
• 1995
• 
  Satoshi Fujita, Tiko Kameda, Masafumi Yamashita:
  A Resource Assignment Problem on Graphs. ISAAC 1995: 418-427
• 1993
• 
  Dominique de Werra, Pavol Hell, Tiko Kameda, Naoki Katoh, Ph. Solot, Masafumi Yamashita:
  Graph endpoint coloring and distributed processing. Networks 23(2): 93-98 (1993)
• 1989
• 
  Masafumi Yamashita, Tiko Kameda:
  Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract). WDAG 1989: 303-314
• 1988
• 
  Masafumi Yamashita, Tiko Kameda:
  Computing on an Anonymous Network. PODC 1988: 117-130