Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMary Inaba
Person information
- unicode name: 稲葉 真理
- affiliation: University of Tokyo, Department of Information Science, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c48]Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
Understand Restart of SAT Solver Using Search Similarity Index (Student Abstract). AAAI 2023: 16236-16237- [c47]Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
Unleashing the Potential of Restart by Detecting the Search Stagnation. LION 2023: 599-613 - [c46]Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
An Empirical Study of the Effect of Learnt Clause on the Structural Measures of SAT problems. POS@SAT 2023: 46-58 - 2022
- [c45]Yoichiro Iida, Tomohiro Sonobe, Mary Inaba:
Diversification of Parallel Search of Portfolio SAT Solver by Search Similarity Index. PRICAI (1) 2022: 61-74
2010 – 2019
- 2019
- [j2]Kenichi Koizumi
, Peter Eades, Kei Hiraki, Mary Inaba:
BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. Int. J. Data Sci. Anal. 7(1): 17-34 (2019) - [c44]Kaneharu Nishino, Hiroshi Tezuka, Mary Inaba:
Toward Shareable Multi-abstraction-level Feature Extractor Based on a Bayesian Network. CORES 2019: 67-78 - 2018
- [c43]Kenichi Koizumi, Kei Hiraki, Mary Inaba:
Skyline Computation for Low-Latency Image-Activated Cell Identification. AAAI 2018: 8101-8102 - [c42]Kaneharu Nishino, Mary Inaba:
Constructing Hierarchical Bayesian Networks With Pooling. AAAI 2018: 8125-8126 - [c41]Kenichi Koizumi, Kei Hiraki, Mary Inaba:
Continuous Skyline Computation Accelerator with Parallelizing Dominance Relation Calculations: (Abstract Only). FPGA 2018: 285 - 2017
- [c40]Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba:
BJR-Tree: Fast Skyline Computation Algorithm for Serendipitous Searching Problems. DSAA 2017: 272-282 - [c39]Reiji Hatsugai, Mary Inaba:
Robust Reinforcement Learning with a Stochastic Value Function. MOD 2017: 519-526 - [c38]Seongsoo Moon, Mary Inaba:
Boost SAT Solver with Hybrid Branching Heuristic. SOCS 2017: 56-63 - 2016
- [c37]Kaneharu Nishino, Mary Inaba:
Bayesian AutoEncoder: Generation of Bayesian Networks with Hidden Nodes for Features. AAAI 2016: 4244-4245 - [c36]Seongsoo Moon, Mary Inaba:
Dynamic Strategy to Diversify Search Using a History Map in Parallel Solving. LION 2016: 260-266 - 2015
- [c35]Kaneharu Nishino, Mary Inaba:
Feature Extraction Based on Generating Bayesian Network. ICONIP (4) 2015: 255-262 - [c34]Kenichi Koizumi, Mary Inaba, Kei Hiraki:
Efficient implementation of continuous skyline computation on a multi-core processor. MEMOCODE 2015: 52-55 - 2014
- [c33]Tomohiro Sonobe, Shuya Kondoh, Mary Inaba:
Community Branching for Parallel Portfolio SAT Solvers. SAT 2014: 188-196 - 2013
- [c32]Tomohiro Sonobe, Mary Inaba:
Portfolio with Block Branching for Parallel SAT Solvers. LION 2013: 247-252 - 2012
- [c31]Yasuo Ishii, Mary Inaba, Kei Hiraki:
Unified memory optimizing architecture: memory subsystem control with a unified predictor. ICS 2012: 267-278 - [c30]Tomohiro Sonobe, Mary Inaba:
Counter Implication Restart for Parallel SAT Solvers. LION 2012: 485-490 - 2011
- [j1]Yasuo Ishii, Mary Inaba, Kei Hiraki:
Access Map Pattern Matching for High Performance Data Cache Prefetch. J. Instr. Level Parallelism 13 (2011) - [c29]Junichiro Makino, Hiroshi Daisaka, Toshiyuki Fukushige, Yutaka Sugawara, Mary Inaba, Kei Hiraki:
The performance of GRAPE-DR for dense matrix operations. ICCS 2011: 888-897 - 2010
- [c28]Hisanobu Tomari, Mary Inaba, Kei Hiraki:
Compressing Floating-Point Number Stream for Numerical Applications. ICNC 2010: 112-119
2000 – 2009
- 2009
- [c27]Yasuo Ishii, Mary Inaba, Kei Hiraki:
Access map pattern matching for data cache prefetch. ICS 2009: 499-500 - [c26]Naoki Tanida, Mary Inaba, Kei Hiraki, Takeshi Yoshino:
Hardware Accelerator for Full-Text Search (HAFTS) with Succinct Data Structure. ReConFig 2009: 155-160 - [c25]Kenichi Koizumi, Mary Inaba, Kei Hiraki, Yasuo Ishii, Takefumi Miyoshi, Kazuki Yoshizoe:
Triple Line-Based Playout for Go - An Accelerator for Monte Carlo Go. ReConFig 2009: 161-166 - 2008
- [c24]Hiroshige Hayashizaki, Yutaka Sugawara, Mary Inaba, Kei Hiraki:
MCAMP: communication optimization on massively parallel machines with hierarchical scratch-pad memory. PACT 2008: 102-111 - [c23]Yasuhiro Ito, Yutaka Sugawara, Mary Inaba, Kei Hiraki:
CVC: The C to RTL compiler for callback-based verification model. FPL 2008: 499-502 - [c22]Yutaka Sugawara, Takeshi Yoshino, Hiroshi Tezuka, Mary Inaba, Kei Hiraki:
Effect of Packet Shuffler on Parallel TCP Stream Network. ICN 2008: 180-185 - [c21]Yutaka Sugawara, Takeshi Yoshino, Hiroshi Tezuka, Mary Inaba, Kei Hiraki:
Effect of Parallel TCP Stream Equalizer on Real Long Fat-pipe Network. NCA 2008: 279-282 - [c20]Takeshi Yoshino, Yutaka Sugawara, Katsushi Inagami, Junji Tamatsukuri, Mary Inaba, Kei Hiraki:
Performance optimization of TCP/IP over 10 gigabit ethernet by precise instrumentation. SC 2008: 11 - 2007
- [c19]Yutaka Sugawara, Mary Inaba, Kei Hiraki:
Flow Balancing Hardware for Parallel TCP Streams on Long Fat Pipe Network. FGCN (1) 2007: 391-396 - [c18]Junichiro Makino, Kei Hiraki, Mary Inaba:
GRAPE-DR: 2-Pflops massively-parallel computer with 512-core, 512-Gflops processor chips for scientific computing. SC 2007: 18 - 2006
- [c17]Mary Inaba, Kei Hiraki:
Network Processing Hardware. AINTEC 2006: 103-112 - 2005
- [c16]Yutaka Sugawara, Mary Inaba, Kei Hiraki:
High-speed and Memory Efficient TCP Stream Scanning using FPGA. FPL 2005: 45-50 - 2004
- [c15]Yutaka Sugawara, Mary Inaba, Kei Hiraki:
Over 10Gbps String Matching Mechanism for Multi-stream Packet Scanning Systems. FPL 2004: 484-493 - [c14]Makoto Nakamura, Hiroyuki Kamezawa, Junji Tamatsukuri, Mary Inaba, Kei Hiraki, K. Mizuguchi, K. Torii, S. Nakano, Shizuo Yoshita, Ryutaro Kurusu, Masakazu Sakamoto, Yuki Furukawa, Takeshi Yanagisawa, Yukichi Ikuta, J. Shitami, Akira Zinzaki:
Long Fat Pipe Congestion Control for Multi-Stream Data Transfer. ISPAN 2004: 294-299 - [c13]Tsuyoshi Ito, Mary Inaba:
Theoretical Analysis of Performances of TCP/IP Congestion Control Algorithm with Different Distances. NETWORKING 2004: 962-973 - [c12]Hiroyuki Kamezawa, Makoto Nakamura, Junji Tamatsukuri, Nao Aoshima, Mary Inaba, Kei Hiraki:
Inter-Layer Coordination for Parallel TCP Streams on Long Fat Pipe Networks. SC 2004: 24 - 2002
- [c11]Kei Hiraki, Mary Inaba, Junji Tamatsukuri, Ryutaro Kurusu, Yukichi Ikuta, Hisashi Koga, Akira Zinzaki:
Data Reservoir: A New Approach to Data-Intensive Scientific Computation. ISPAN 2002: 269-274 - [c10]Kei Hiraki, Mary Inaba, Junji Tamatsukuri, Ryutaro Kurusu, Yukichi Ikuta, Hisashi Koga, Akira Zinzaki:
Data Reservoir: utilization of multi-gigabit backbone network for data-intensive research. SC 2002: 18:1-18:9 - 2000
- [c9]Mary Inaba, Hiroshi Imai:
Finding k-Closest-Pairs Efficiently for High Dimensional Data. CCCG 2000
1990 – 1999
- 1998
- [c8]Mary Inaba, Hiroshi Imai:
Geometric clustering models for multimedia databases. CCCG 1998 - [c7]Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai:
Voronoi Diagrams by Divergences with Additive Weights. SCG 1998: 403-404 - [c6]Mary Inaba, Hiroshi Imai:
Geometric Clustering Models in Feature Space. Discovery Science 1998: 421-422 - 1997
- [c5]Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi:
Application of an Effective Geometric Clustering Method to the Color Quantization Problem. SCG 1997: 477-478 - 1996
- [c4]Mary Inaba, Hiroshi Imai, Naoki Katoh:
Experimental Results of Randomized Clustering Algorithm. SCG 1996: C-1-C-2 - [c3]Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis:
A Package for Triangulations. SCG 1996: V-17-V-18 - 1994
- [c2]Mary Inaba, Yasukazu Aoki, Susumu Hasegawa:
Level Difference of the Reconstructed Arrangement. CCCG 1994: 12-17 - [c1]Mary Inaba, Naoki Katoh, Hiroshi Imai:
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). SCG 1994: 332-339
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-21 18:18 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:
