Items where department is "Mathematics"

University Structure (106206) LSE (106206) Academic Departments (62869) Mathematics (1461)
Number of items: 36.
A
  • Alpern, Steven, Gal, Shmuel (2003). The Theory of Search Games and Rendezvous. Springer Berlin / Heidelberg.
  • Anthony, Martin (2003-05-01 - 2003-05-03) Accuracy of classification by iterative linear thresholding [Paper]. SIAM International Conference on Data Mining, CA., United States, USA.
  • Anthony, Martin (2003). Boolean functions and artificial neural networks. (CDAM research report series LSE-CDAM-2003-01). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2003-05-01 - 2003-05-03) Data classification by multithreshold functions [Paper]. SIAM International Conference on Data Mining, CA., United States, USA.
  • Anthony, Martin (2003). Learning multivalued multithreshold functions. (CDAM Research Report Series LSE-CDAM-2003-03). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2003). Links between learning and optimization: a brief tutorial. (CDAM research report series LSE-CDAM-2003-02). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2003). Margin-based generalization error bounds for threshold decision lists. (CDAM research report series LSE-CDAM-2003-09). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Anthony, Martin (2003). On Boolean combinations of definitive classifiers. (CDAM Research Report Series LSE-CDAM-2003-22). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Franco, Leonardo, Anthony, Martin (2003). The influence of opposite examples and randomness on the generalization complexity of Boolean functions. (CDAM research report series LSE-CDAM-2003-21). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
    • B
  • Ball, J. A., Mikkola, K. M., Sasane, Amol (2003). State-space formulas for the Nehari-Takagi problem for nonexponentially stable infinite-dimensional systems. (Report 32). Institut Mittag-Leffler, The Royal Swedish Academy of Sciences.
  • Batu, Tugkan, Ergun, Funda, Kilian, Joe, Magen, Avner, Raskhodnikova, Sofya, Rubinfeld, Robin, Sami, Rahul (2003-06-09 - 2003-06-11) A sublinear algorithm for weakly approximating edit distance [Paper]. 35th ACM Symposium on Theory of Computing (STOC), California, United States, USA.
  • Bekmetjev, Airat, Brightwell, Graham, Czygrinow, Andrzej, Hurlbert, Glenn (2003). Thresholds for families of multisets, with an application to graph pebbling. Discrete Mathematics, 269(1-3), 21-34. https://doi.org/10.1016/S0012-365X(02)00745-8
  • Biggs, Norman (2003). Specht modules and chromatic polynomials. (CDAM research report LSE-CDAM-2003-06). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Bollobás, Bela, Brightwell, Graham R. (2003). The number of k-SAT functions. Random Structures and Algorithms, 22(3), 227-247. https://doi.org/10.1002/rsa.10079
  • Bollobás, Bela, Brightwell, Graham R., Leader, I. (2003). The number of 2-SAT functions. Israel Journal of Mathematics, 133, 45-60.
  • Brightwell, Graham, Winkler, Peter (2003). A second threshold for the hard-core model on a Bethe lattice. (CDAM research report series LSE-CDAM-2003-05). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
  • Brightwell, Graham R., Dowker, Fay, Garciá, Raquel S., Henson, Joe, Sorkin, Rafael D. (2003). "Observables" in causal set cosmology. Physical Review D, 67(8), Art. no. 084031. https://doi.org/10.1103/PhysRevD.67.084031
  • Brightwell, Graham R., Oriolo, G., Shepherd, F. B. (2003). Reserving resilient capacity for a single commodity with upper-bound constraints. Networks, 41(2), 87-96. https://doi.org/10.1002/net.10064
  • Brightwell, Graham R., Tetali, Prasad (2003). The number of linear extensions of the Boolean lattice. Order - a Journal on the Theory of Ordered Sets and Its Applications, 20(4), 333-345.
    • C
  • Sasane, Amol, Curtain, Ruth F. (2003). Hankel norm approximation for well-posed linear systems. Systems and Control Letters, 48(5), 407-414. https://doi.org/10.1016/S0167-6911(02)00301-8
    • G
  • Luczak, Malwina J. (2003). A quantitative law of large numbers via exponential martingales. In Gine, Evariste, Houdre, Christian, Nualart, David (Eds.), Stochastic Inequalities and Applications (pp. 93-112). Birkhäuser (Firm).
    • H
  • Hilton, A. J. W., Johnson, Matthew (2003). An algorithm for finding factorizations of complete graphs. Journal of Graph Theory, 43(2), 132-136. https://doi.org/10.1002/jgt.10109
    • K
  • Lftime, O. V., Kaashoek, M. A., Sandberg, H., Sasane, Amol (2003). A Grassmannian approach to the Hankel norm approximation problem. Institut Mittag-Leffler, The Royal Swedish Academy of Sciences.
    • L
  • Luczak, Malwina J., McDiarmid, Colin (2003). Concentration for locally acting permutations. Discrete Mathematics, 265(1-3), 159-171.
  • Luczak, Malwina J., McDiarmid, Colin, Upfal, Eli (2003). On-line routing of random calls in networks. Probability Theory and Related Fields, 125(4), 457-482. https://doi.org/10.1007/s00440-002-0242-2
    • M
  • Martini, Horst, Swanepoel, Konrad (2003). Generalized convexity notions and combinatorial geometry. Congressus Numerantium, 164, 65-93.
  • Martini, Horst, Swanepoel, Konrad, Weiss, G. (2003-02-27 - 2003-03-01) Some location problems in normed linear spaces [Paper]. Dresden Symposium Geometrie: konstruktiv & kinematisch, Dresden, Germany, DEU.
  • van den Heuvel, Jan, McGuinness, Sean (2003). Coloring the square of a planar graph. Journal of Graph Theory, 42(2), 110-124. https://doi.org/10.1002/jgt.10077
    • O
  • Ostaszewski, Adam (2003). Dividend irrelevancy: Ohlson's uniqueness principle in several accounting variables. (CDAM research report series). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
    • R
  • Reinfeld, Philipp Augustin (2003). Algebraic methods for chromatic polynomials [Doctoral thesis]. London School of Economics and Political Science. picture_as_pdf
    • S
  • Sasane, Amol (2003). On the Willems closure with respect to Ws. IMA Journal of Mathematical Control and Information, 20(2), 217-232. https://doi.org/10.1093/imamci/20.2.217
  • Sasane, Amol J. (2003). Distance between behaviours. International Journal of Control, 76(12), 1214-1223. https://doi.org/10.1080/0020717031000138647
  • Simon, Robert (2003). Games of incomplete information, ergodic theory, and the measurability of equilibria. Israel Journal of Mathematics, 138(1), 73-92. https://doi.org/10.1007/BF02783420
  • Swanepoel, Konrad (2003). Helly-type theorems for homothets of planar convex curves. Proceedings of the Mathematical Society, 131(3), 921-932. https://doi.org/10.1090/S0002-9939-02-06722-9
    • V
  • von Stengel, Bernhard (2003). Follower payoffs in symmetric duopoly games. (CDAM research report series LSE-CDAM-2003-13). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science.
    • Z
  • Zervos, Mihail (2003). A problem of sequential entry and exit decisions combined with discretionary stopping. SIAM Journal on Control and Optimization, 42(2), 397-421. https://doi.org/10.1137/S036301290038111X