Zobrazeno 1 - 7
of 7
pro vyhledávání: '"T. A. Szymanski"'
Autor:
T. H. Szymanski, D. Gilbert
Publikováno v:
International Journal of Digital Multimedia Broadcasting, Vol 2010 (2010)
The design of an IPTV multicast system for the Internet backbone network is presented and explored through extensive simulations. In the proposed system, a resource reservation algorithm such as RSVP, IntServ, or DiffServ is used to reserve resources
Externí odkaz:
https://doaj.org/article/d47bbb76653b4527a520dfa8168c6c68
Autor:
T. H. Szymanski, Bell Canada Chair
Publikováno v:
2011 IEEE Nineteenth IEEE International Workshop on Quality of Service.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::147d8cc5557848b5e0f773cfe680d022
https://doi.org/10.1109/iwqos.2011.5931336
https://doi.org/10.1109/iwqos.2011.5931336
Publikováno v:
Bell System Technical Journal. 59:1343-1356
This paper describes a new search procedure and its application to the problem of obtaining telephone directory information from spoken spelled input. The method obtains its speed from using the concept of equivalence classes, with names classified a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f39b060fdd5e0624241846d6ecaf1122
https://doi.org/10.1002/j.1538-7305.1980.tb03367.x
https://doi.org/10.1002/j.1538-7305.1980.tb03367.x
Publikováno v:
The Journal of Nutrition. 36:171-175
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d760ac876a33cec7e0be34587e176f78
https://doi.org/10.1093/jn/36.1.171
https://doi.org/10.1093/jn/36.1.171
Autor:
John R. Murlin, E. S. Nasset, Estelle E. Hawley, T. A. Szymanski, Margery Blackwood, James A. Robinson
Publikováno v:
The Journal of Nutrition. 36:153-169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa2ca09d12fcd2a6a3a3efa17f34191b
https://doi.org/10.1093/jn/36.1.153
https://doi.org/10.1093/jn/36.1.153
Autor:
H. B. Hunt, T. G. Szymanski
Publikováno v:
STOC
We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program schemes, simple programming languages, and automata. These techniques include dichotomization, extensions of dichotomizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35ca0b2148fae5273b87798b2b041289
https://doi.org/10.1145/800113.803640
https://doi.org/10.1145/800113.803640
Autor:
H. B. Hunt, T. G. Szymanski
Publikováno v:
STOC
In [1] and [2] a complexity theory for formal languages and automata was developed. This theory implies most of the previously known results and yields many new results as well. Here we develop an analogous theory for several classes of more practica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df73c7a4552a4cabfebefc5d375d65aa
https://doi.org/10.1145/800116.803753
https://doi.org/10.1145/800116.803753