{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:21Z","timestamp":1725484281732},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439967"},{"type":"electronic","value":"9783540456551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_14","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:37:01Z","timestamp":1179733021000},"page":"117-126","source":"Crossref","is-referenced-by-count":0,"title":["Inferring a Union of Halfspaces from Examples"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Sascha","family":"Ott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CPM 2002","author":"T. Akutsu","year":"2002","unstructured":"Akutsu, T., Bannai, H., Miyano, S., Ott, S.: On the complexity of deriving position specific score matrices from examples. Proc. CPM 2002. Lecture Notes in Computer Science (to appear)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E. Amaldi","year":"1995","unstructured":"Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science 147 (1995) 181\u2013210","journal-title":"Theoretical Computer Science"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(97)00115-1","volume":"209","author":"E. Amaldi","year":"1998","unstructured":"Amaldi, E., Kann, V.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science 209 (1998) 237\u2013260","journal-title":"Theoretical Computer Science"},{"key":"14_CR4","unstructured":"Arora, S., Kannan, R.: Learning mixtures of arbitrary gaussians. Proc. 33rd ACM Symp. Theory of Computing (2001) 247\u2013257"},{"key":"14_CR5","unstructured":"Clarkson, K.L., Eppstein, D., Miller, G.L., Sturtivant, C., Teng S-H.: Approximating center points with iterated radon points. Proc. 9th ACM Symp. Computational Geometry (1993) 91\u201398"},{"key":"14_CR6","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning 20 (1995) 273\u2013297","journal-title":"Machine Learning"},{"key":"14_CR7","volume-title":"Probabilistic Models of Proteins and Nucleic Acids","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, New York (1998)"},{"key":"14_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin Heidelberg New York (1987)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Computer and System Sciences 57 (1998) 187\u2013199","journal-title":"J. Computer and System Sciences"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Computer and System Sciences 55 (1997) 119\u2013139","journal-title":"J. Computer and System Sciences"},{"key":"14_CR11","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Computer and System Sciences 9 (1974) 256\u2013278","journal-title":"J. Computer and System Sciences"},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. The MIT Press, Cambridge, MA (1994)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. SIAM J. Computing 12 (1983) 759\u2013776","journal-title":"SIAM J. Computing"},{"key":"14_CR15","volume-title":"Randomized Algorithms","author":"R. Motowani","year":"1994","unstructured":"Motowani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1994)"},{"key":"14_CR16","first-page":"589","volume":"7","author":"R. Radivojac","year":"2002","unstructured":"Radivojac, R., Obradoviv, Z., Brown, C.J., Dunker, A.K.: Improving sequence alignments for intrinsically disordered proteins. Pacific Symp. Biocomputing 7 (2002) 589\u2013600","journal-title":"Pacific Symp. Biocomputing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:43:05Z","timestamp":1550331785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}