Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 50.
Article
  • Anthony, Martin (2004). Generalization error bounds for threshold decision lists. Journal of Machine Learning Research, 5(Feb), 189-217.
  • Anthony, Martin (2004). On data classification by iterative linear partitioning. Discrete Applied Mathematics, 144(1-2), 2-16.
  • Anthony, Martin (2004). Partitioning points by parallel planes. Discrete Mathematics, 282(1-3), 17-21.
  • Anthony, Martin (2004). Some connections between learning and optimization. Discrete Applied Mathematics, 144(1-2), 17-26. https://doi.org/10.1016/j.dam.2004.06.005
  • Biggs, Norman (2004). Specht modules and chromatic polynomials. Journal of Combinatorial Theory, Series B, 92(2), 359-377. https://doi.org/10.1016/j.jctb.2004.09.001
  • Biggs, Norman, Klin, MH, Reinfeld, Philipp Augustin (2004). Algebraic methods for chromatic polynomials. European Journal of Combinatorics, 25(2), 147-160. https://doi.org/10.1016/S0195-6698(03)00095-7
  • Brightwell, Graham, Winkler, P. (2004). A second threshold for the hard-core model on a Bethe lattice. Random Structures & Algorithms, 24(3), 303-314. https://doi.org/10.1002/rsa.20006
  • Gapeev, Pavel V. (2004). On arbitage and Markovian short rates for fractional bond markets. Statistics and Probability Letters, 70(3), 211-222. https://doi.org/10.1016/j.spl.2004.10.008
  • Gapeev, Pavel V., Peskir, G. (2004). The Wiener sequential testing problem with finite horizen. Stochastics and Stochastic Reports, 76(1), 59-75. https://doi.org/10.1080/10451120410001663753
  • Gietzmann, Miles B., Ostaszewski, Adam (2004). An alternative to the Feltham-Ohlson valuation framework: using q-theoretic income to predict firm value. Accounting and Business Research, 34(4), 349-377. https://doi.org/10.1080/00014788.2004.9729977
  • Govindan, Srihari, von Schemde, Arndt, von Stengel, Bernhard (2004). Symmetry and p-stability. International Journal of Game Theory, 32(3), 359-369. https://doi.org/10.1007/s001820400167
  • Iftime, Orest V., Sasane, Amol J. (2004). Sub-optimal Hankel norm approximation problem: a frequency domain approach. Systems and Control Letters, 52(1), 75-83. https://doi.org/10.1016/j.sysconle.2003.11.002
  • Lewis-Pye, Andrew (2004). Finite cupping sets. Archive for Mathematical Logic, 43(7), 845-858. https://doi.org/10.1007/s00153-004-0215-5
  • Lewis-Pye, Andrew (2004). Minimal complements for degrees below 0'. Journal of Symbolic Logic, 69(4), 937-966. https://doi.org/10.2178/jsl/1102022208
  • Luczak, Malwina J., Winkler, Peter (2004). Building uniformly random subtrees. Random Structures and Algorithms, 24(4), 420-443. https://doi.org/10.1002/rsa.20011
  • Martini, Horst, Swanepoel, Konrad (2004). Equiframed curves - a generalization of Radon curves. Monatshefte fur Mathematik, 141(4), 301-314. https://doi.org/10.1007/s00605-003-0052-3
  • Martini, Horst, Swanepoel, Konrad (2004). Non-planar simplices are not reduced. Publicationes Mathematicae Debrecen, 64(1-2), 101-106.
  • Martini, Horst, Swanepoel, Konrad (2004). The geometry of Minkowski spaces - a survey. Part II. Expositiones Mathematicae, 22(2), 93-144. https://doi.org/10.1016/S0723-0869(04)80009-4
  • Ostaszewski, Adam (2004). "Equity smirks" and embedded options: the shape of a firm's value function. Accounting and Business Research, 34(4), 301-321. https://doi.org/10.1080/00014788.2004.9729974
  • Pretorius, Lou M., Swanepoel, Konrad (2004). An algorithmic proof of the Motzkin-Rabin theorem. American Mathematical Monthly, 111(3), 245-251.
  • Rödl, Vojtech, Skokan, Jozef (2004). Regularity lemma for k-uniform hypergraphs. Random Structures & Algorithms, 25(1), 1-42. https://doi.org/10.1002/rsa.20017
  • Sasane, Amol J. (2004). Time-autonomy and time-controllability of 2-D behaviours that are tempered in the spatial direction. Multidimensional Systems and Signal Processing, 15(2), 97-116.
  • Skokan, Jozef, Thoma, Lubos (2004). Bipartite subgraphs and quasi-randomness. Graphs and Combinatorics, 20(2), 255-262. https://doi.org/10.1007/s00373-004-0556-1
  • Swanepoel, Konrad (2004). A problem of Kusner on equilateral sets. Archiv Der Mathematik, 83(2), 164-170. https://doi.org/10.1007/s00013-003-4840-8
  • Book
  • Batu, Tugkan, Guha, Sudipto, Kannan, Sampath (2004). Inferring mixtures of Markov chains. Springer Berlin / Heidelberg. https://doi.org/10.1007/b98522
  • Chapter
  • Anthony, Martin (2004). On Learning a Function of Perceptrons. In Proceedings of the IEEE 2004 International Joint Conference on Neural Networks (pp. 967-972). IEEE Press. https://doi.org/10.1109
  • Brightwell, Graham, Winkler, Peter (2004). Graph homomorphisms and long range action. In Nešetril, Jaroslav, Winkler, Peter (Eds.), Graphs, Morphisms and Statistical Physics (pp. 29-48). American Mathematical Society.
  • Franco, Leonardo, Anthony, Martin (2004). On a generalisation complexity measure for boolean functions. In Proceedings of the IEEE 2004 International Joint Conference on Neural Networks . IEEE Press.
  • Sasane, Amol (2004). The elusive iff test for time-controllability of behaviours. In Blondel, Vincent D, Megretski, Alexandre (Eds.), Unsolved Problems in Mathematical Systems and Control Theory (pp. 36-39). Princeton University Press.
  • Swanepoel, Konrad (2004). Equilateral sets in finite-dimensional normed spaces. In Girela, Daniel, López Acedo, Gernaro, Villa Caro, Rafael (Eds.), Seminar of Mathematical Analysis (pp. 195-237). Universidad de Sevilla. Secretariado de Publicaciones.
  • Swanepoel, Konrad, Valtr, P. (2004). The unit distance problem on spheres. In Pach, János (Ed.), Towards a Theory of Geometric Graphs (pp. 273-280). American Mathematical Society.
  • Conference or Workshop Item
  • Batu, Tugkan, Kannan, Sampath, Khanna, Sanjeev, McGregor, Andrew (2004-01-11 - 2004-01-13) Reconstructing strings from random traces [Paper]. ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, United States, USA.
  • Batu, Tugkan, Kumar, Ravi, Rubinfeld, Ronitt (2004-06-13 - 2004-06-15) Sublinear algorithms for testing monotone and unimodal distributions [Paper]. 36th ACM Symposium on Theory of Computing (STOC), IL., United States, USA.
  • Lftime, O.V., Kaashoek, M. A., Sandberg, H., Sasane, A. J. (2004-07-05 - 2004-07-09) A Grassmannian approach to the Hankel norm approximation problem [Paper]. Sixteenth International Symposium on Mathematical Theory of Networks and Systems, Leuven, Belgium, BEL.
  • Savani, Rahul, von Stengel, Bernhard (2004-10-17 - 2004-10-19) Exponentially many steps for finding a Nash equilibrium in a bimatrix game [Paper]. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), Rome, Italy, ITA.
  • Report
  • Alon, Noga, Brightwell, Graham, Kierstead, H. A., Kostochka, A. V., Winkler, Peter (2004). Dominating sets in k-majority tournaments. (CDAM research report series LSE-CDAM-2004-11). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven (2004). Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice). (CDAM Research Report Series LSE-CDAM-2004-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic (2004). Rendezvous in higher dimensions. (CDAM Research Report Series LSE-CDAM-2004-06). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic (2004). Rendezvous on a planar lattice. (CDAM research report series LSE-CDAM-2004-08). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic (2004). A common notion of clockwise can help in planar rendezvous. (CDAM research report series LSE-CDAM-2004-07). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Alpern, Steven, Reyniers, Diane J. (2004). Strategic mating with common preferences. (CDAM research report series LSE-CDAM-2004-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin, Hammer, Peter L. (2004). A Boolean measure of similarity. (RUTCOR research reports 27-2004). Rutgers Center for Operations Research, Rutgers University.
  • Ball, Joseph, Sasane, Amol J. (2004). Equivalence of a behavioral distance and the gap metric. (CDAM research report series LSE-CDAM-2004-17). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Borodin, O. V., Broersma, H. J., Glebov, A., van den Heuvel, Jan (2004). A new upper bound on the cyclic chromatic number. (CDAM research report series LSE-CDAM-2004-04). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Brightwell, Graham, Winkler, Peter (2004). Note on counting Eulerian circuits. (CDAM research report series LSE-CDAM-2004-12). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Savani, Rahul, von Stengel, Bernhard (2004). Exponentially many steps for finding a Nash equilibrium in a bimatrix game. (CDAM research report series LSE-CDAM-2004-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, Johnson, Matthew (2004). Transversals of subtree hypergraphs and the source location problem in digraphs. (CDAM research report series CDAM-2004-10). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • van den Heuvel, Jan, Johnson, Matthew (2004). The external network problem. (CDAM research report series LSE-CDAM-2004-15). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • von Stengel, Bernhard, Zamir, Schmuel (2004). Leadership with commitment to mixed strategies. (CDAM research report series LSE-CDAM-2004-01). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Thesis
  • von Schemde, Arndt (2004). A geometric-combinatorial approach to index and stability in bimatrix games [Doctoral thesis]. London School of Economics and Political Science. picture_as_pdf