Filters








644 Hits in 7.0 sec

Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph [chapter]

Eiji Takimoto, Manfred K. Warmuth
1999 Lecture Notes in Computer Science  
We design e cient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles.  ...  It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.  ...  Acknowledgements We would like to thank Hiroshi Nagamochi for calling our attention to the duality of planar graphs.  ... 
doi:10.1007/3-540-46769-6_28 fatcat:3d6aei2c2baqvf6eoc4czwdbsa

Predicting nearly as well as the best pruning of a planar decision graph

Eiji Takimoto, Manfred K. Warmuth
2002 Theoretical Computer Science  
We design e cient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles.  ...  It can also be used to design algorithms that predict nearly as well as the best convex combination of prunings.  ...  Acknowledgements We would like to thank Hiroshi Nagamochi for calling our attention to the duality of planar graphs.  ... 
doi:10.1016/s0304-3975(01)00401-7 fatcat:dou3ggzws5hhhfeu6vwu52pn2m

Page 9552 of Mathematical Reviews Vol. , Issue 2003m [page]

2003 Mathematical Reviews  
Summary: “We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles.  ...  a planar decision graph.  ... 

Preface

Osamu Watanabe, Arun Sharma
2002 Theoretical Computer Science  
They show e cient on-line algorithms that can predict nearly as well as the best pruning of a given decision graph.  ...  Takimoto and Warmuth investigate a problem of pruning planar directed acyclic decision graphs which is a generalization of decision tree pruning.  ... 
doi:10.1016/s0304-3975(01)00399-1 fatcat:qrvdiul5rragbnd4cvfdkyrycq

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem [article]

Joeri Sleegers, Daan van den Berg
2021 arXiv   pre-print
This is most likely due to the costliness of the extra search pruning procedures, which are relatively elaborate.  ...  In fact, almost all the hard instances reside in one area: near the Komlós-Szemerédi bound, of 1/2 v· ln(v) + 1/2 v· ln( ln(v)) edges, where randomly generated graphs have an approximate 50% chance of  ...  As (planar) mazes are in many ways equivalent to (planar) graphs, its success as an algorithm for graph traversal is hardly surprising.  ... 
arXiv:2107.00314v1 fatcat:fnvtens2jjfpbognu57dlg55qq

Fast and adaptive mode decision and CU partition early termination algorithm for intra-prediction in HEVC

Mengmeng Zhang, Xiaojun Zhai, Zhi Liu
2017 EURASIP Journal on Image and Video Processing  
In this study, we first analyzed the statistical relationship between the best mode and the costs calculated through Rough Mode Decision (RMD) process and proposed an effective mode decision algorithm  ...  We then used the coding bits of the current coding unit (CU) as the main basis for judging its complexity and proposed an early termination method for CU partition based on the number of coding bits of  ...  Availability of data and materials The conclusion and comparison data of this article are included within the article.  ... 
doi:10.1186/s13640-017-0237-7 fatcat:msthzalfwnd2vb6xpu2iglxsmy

Multilingual Joint Parsing of Syntactic and Semantic Dependencies with a Latent Variable Model

James Henderson, Paola Merlo, Ivan Titov, Gabriele Musillo
2013 Computational Linguistics  
In this article, we report on a joint generative history-based model to predict the most likely derivation of a dependency parser for both syntactic and semantic dependencies, in multiple languages.  ...  These synchronized subsequences encompass decisions about the left side of each individual word.  ...  The research leading to these results has received funding from the EU FP7 programme (FP7/2007-2013, and from the Swiss NSF under grants 122643 and 119276.  ... 
doi:10.1162/coli_a_00158 fatcat:mtvi7qkngjgrhjyyztr4zf5itq

Path Kernels and Multiplicative Updates [chapter]

Eiji Takimoto, Manfred K. Warmuth
2002 Lecture Notes in Computer Science  
The examples include efficient algorithms for learning disjunctions and a recent algorithm that predicts as well as the best pruning of a series parallel digraphs.  ...  We then discuss multiplicative updates on these graphs where the prediction is essentially a kernel computation and the update contributes a factor to each edge.  ...  Manfred Warmuth acknowledges the support of NSF grant CCR-9821087.  ... 
doi:10.1007/3-540-45435-7_6 fatcat:c22lnjna6nh45g7p6xhywoh2xu

Symbolic, Neural, and Bayesian Machine Learning Models for Predicting Carcinogenicity of Chemical Compounds

Dennis Bahler, Brian Stone, Carol Wellington, Douglas W. Bristol
2000 Journal of chemical information and computer sciences  
The ability to predict the outcome of the analysis at various points in the process would facilitate informed decisions about the allocation of testing resources.  ...  As a training set we used recent results from rodent carcinogenicity bioassays conducted by the National Toxicology Program (NTP) on 226 test articles.  ...  Acknowledgments The authors would like to thank Dr. Ray Tennant of NIEHS and Dr.  ... 
doi:10.1021/ci990116i pmid:10955517 fatcat:br72nhnysvghhhgjfgf3v7abxy

Computational strategies for object recognition

Paul Suetens, Pascal Fua, Andrew J. Hanson
1992 ACM Computing Surveys  
More details of this approach are given in Appendix C. 3.1.6 When to Use this Strategy The strategy of optimizing the match to information represented as a graph works best when a comprehensive  ...  - guage as well as their dependencies.  ... 
doi:10.1145/128762.128763 fatcat:k3otboj2wfcqpfkwufcqwcephm

Route Planning in Transportation Networks [chapter]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2016 Lecture Notes in Computer Science  
Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic.  ...  A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time.  ...  In real transportation networks, the best route often depends on the departure time in a predictable way [102] .  ... 
doi:10.1007/978-3-319-49487-6_2 fatcat:zbg272ftdfempady3cjynh6q4e

Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions [chapter]

Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham
2002 Lecture Notes in Computer Science  
We identify a large number of distribution-nonspecific features of data instances and use statistical regression techniques to learn, evaluate and interpret a function from these features to the predicted  ...  We propose a new approach for understanding the algorithm-specific empirical hardness of N P-Hard problems.  ...  in the best subset of a given size.  ... 
doi:10.1007/3-540-46135-3_37 fatcat:oa4g7bkgkbdi7lruy6cnjh65bq

Learning-based Application-Agnostic 3D NoC Design for Heterogeneous Manycore Systems [article]

Biresh Kumar Joardar, Ryan Gary Kim, Janardhan Rao Doppa, Partha Pratim Pande, Diana Marculescu, Radu Marculescu
2018 arXiv   pre-print
More importantly, our results suggest that our 3D NoCs optimized for a few applications can be generalized for unknown applications as well.  ...  However, as systems use heterogeneity (e.g., a combination of CPUs, GPUs, and accelerators) to improve performance and efficiency, it becomes more pertinent to address the distinct and likely conflicting  ...  As a result, the optimized NoCs are expected to be similar as well.  ... 
arXiv:1810.08869v1 fatcat:a3itqouqebeprgtbwk66ceh3ny

Bridging Socially Enhanced Virtual Communities

Venugopal Rao
2013 IOSR Journal of Computer Engineering  
The architecture of the proposed system is compromising of human activities and also automated activities and it is essentially a service oriented system.  ...  The communication and interactions across the companies has become a common phenomenon.  ...  First and foremost I would like to acknowledge the ongoing support of Dr. Sanjay Sharma and Prof. Akhilesh A. Waoo, Project Guide, BIST Bhopal in the design and implementation of the project.  ... 
doi:10.9790/0661-0940104 fatcat:zejgpenvqzb7rkchkznv5igfwm

Route Planning in Transportation Networks [article]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015 arXiv   pre-print
Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic.  ...  A variety of techniques provide different trade-offs between preprocessing effort, space requirements, and query time.  ...  Time-Dependence In real transportation networks, the best route often depends on the departure time in a predictable way [102] .  ... 
arXiv:1504.05140v1 fatcat:ox42rhvuynd5loq6dljhnfecvu
« Previous Showing results 1 — 15 out of 644 results