Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleApril 2024
Generalization analysis on learning with a concurrent verifier
NIPS '22: Proceedings of the 36th International Conference on Neural Information Processing SystemsArticle No.: 302, Pages 4177–4188Machine learning technologies have been used in a wide range of practical systems. In practical situations, it is natural to expect the input-output pairs of a machine learning model to satisfy some requirements. However, it is difficult to obtain a ...
- research-articleDecember 2021
Efficient Network Reliability Evaluation for Client-Server Model
2021 IEEE Global Communications Conference (GLOBECOM)Pages 1–6https://doi.org/10.1109/GLOBECOM46510.2021.9685283Network reliability, i.e., the probability of connecting a set of specified nodes under stochastic link failure, is a key indicator of network infrastructure, such as communication and power. Since network reliability evaluation is a computationally heavy ...
- research-articleApril 2018
Optimizing Network Reliability via Best-First Search over Decision Diagrams
IEEE INFOCOM 2018 - IEEE Conference on Computer CommunicationsPages 1817–1825https://doi.org/10.1109/INFOCOM.2018.8485859Communication networks are an essential infrastructure and must be designed carefully to ensure high reliability. Identifying a fully reliable design is, however, computationally very tough since it requires that a reliability evaluation, which is known ...
- research-articleFebruary 2018
Submodular function maximization over graphs via zero-suppressed binary decision diagrams
AAAI'18/IAAI'18/EAAI'18: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial IntelligenceArticle No.: 174, Pages 1422–1430Submodular function maximization (SFM) has attracted much attention thanks to its applicability to various practical problems. Although most studies have considered SFM with size or budget constraints, more complex constraints often appear in practice. In ...
- ArticleFebruary 2017
Compiling graph substructures into sentential decision diagrams
The Zero-suppressed Sentential Decision Diagram (ZSDD) is a recently discovered tractable representation of Boolean functions. ZSDD subsumes the Zero-suppressed Binary Decision Diagram (ZDD) as a strict subset, and similar to ZDD, it can perform several ...
- ArticleFebruary 2017
Dancing with decision diagrams: a combined approach to exact cover
Exact cover is the problem of finding subfamilies, S*, of a family of sets, S, over universe U, where S* forms a partition of U. It is a popular NP-hard problem appearing in a wide range of computer science studies. Knuth's algorithm DLX, a backtracking-...
- ArticleFebruary 2016
Zero-suppressed Sentential Decision Diagrams
The Sentential Decision Diagram (SDD) is a prominent knowledge representation language that subsumes the Ordered Binary Decision Diagram (OBDD) as a strict subset. Like OBDDs, SDDs have canonical forms and support bottom-up operations for combining SDDs,...
- research-articleNovember 2015
Summarizing a document by trimming the discourse tree
IEEE/ACM Transactions on Audio, Speech and Language Processing (TASLP), Volume 23, Issue 11Pages 2081–2092https://doi.org/10.1109/TASLP.2015.2465150Recent studies on extractive text summarization formulate it as a combinatorial optimization problem, extracting the optimal subset from a set of the textual units that maximizes an objective function without violating the length constraint. Although ...
- ArticleJanuary 2015
BDD-constrained search: a unified approach to constrained shortest path problems
Dynamic programming (DP) is a fundamental tool used to obtain exact, optimal solutions for many combinatorial optimization problems. Among these problems, important ones including the knapsack problems and the computation of edit distances between ...
- ArticleMarch 2013
Sub-sentence extraction based on combinatorial optimization
ECIR'13: Proceedings of the 35th European conference on Advances in Information RetrievalPages 812–815https://doi.org/10.1007/978-3-642-36973-5_91This paper describes the prospect of word extraction for text summarization based on combinatorial optimization. Instead of the commonly used sentence-based approach, word-based approaches are preferable if highly-compressed summarizations are required. ...
- ArticleMarch 2013
Text summarization while maximizing multiple objectives with lagrangian relaxation
ECIR'13: Proceedings of the 35th European conference on Advances in Information RetrievalPages 772–775https://doi.org/10.1007/978-3-642-36973-5_81We show an extractive text summarization method that solves an optimization problem involving the maximization of multiple objectives. Though we can obtain high quality summaries if we solve the problem exactly with our formulation, it is NP-hard and ...
- ArticleSeptember 2012
A Query-Focused Summarization Method that Guarantees the Inclusion of Query Words
DEXA '12: Proceedings of the 2012 23rd International Workshop on Database and Expert Systems ApplicationsPages 126–130https://doi.org/10.1109/DEXA.2012.59Query-focused summarization is a variant of automatic summarization that uses a given query to generate summaries. It is used, for example, to generate search result snippets. Although conventional score-based methods tend to generate summaries that ...
- research-articleNovember 2009
Geographic information retrieval to suit immediate surroundings
GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsPages 452–455https://doi.org/10.1145/1653771.1653842This paper proposes a highly effective geographic information retrieval method. It assesses the extent implied by place names in documents and then emphasizes place names that are highly specific in terms of identifying locations. Furthermore, the ...
- posterOctober 2008
Incorporating place name extents into geo-ir ranking
CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge managementPages 1489–1490https://doi.org/10.1145/1458082.1458349This paper proposes a novel Geo-IR ranking method that realizes effective searches that emphasize the user's immediate surroundings. It assesses the extent implied by place names in documents and then emphasizes place names that are highly specific in ...
- articleNovember 2007
Supervised automatic evaluation for summarization with voted regression model
Information Processing and Management: an International Journal (IPRM), Volume 43, Issue 6Pages 1521–1535https://doi.org/10.1016/j.ipm.2007.01.012The high quality evaluation of generated summaries is needed if we are to improve automatic summarization systems. Although human evaluation provides better results than automatic evaluation methods, its cost is huge and it is difficult to reproduce the ...
- research-articleJune 2007
Japanese dependency parsing using sequential labeling for semi-spoken language
ACL '07: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration SessionsPages 225–228The amount of documents directly published by end users is increasing along with the growth of Web 2.0. Such documents often contain spoken-style expressions, which are difficult to analyze using conventional parsers. This paper presents dependency ...
- ArticleOctober 2000
WIT: a toolkit for building robust and real-time spoken dialogue systems
- Mikio Nakano,
- Noboru Miyazaki,
- Norihito Yasuda,
- Akira Sugiyama,
- Jun-ichi Hirasawa,
- Kohji Dohsaka,
- Kiyoaki Aikawa
SIGDIAL '00: Proceedings of the 1st SIGdial workshop on Discourse and dialogue - Volume 10Pages 150–159https://doi.org/10.3115/1117736.1117753This paper describes WIT, a toolkit for building spoken dialogue systems. WIT features an incremental understanding mechanism that enables robust utterance understanding and realtime responses. WIT's ability to compile domain-dependent system ...