Zobrazeno 1 - 10 of 43 pro vyhledávání: '"Poon, S.H."'
1
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
2
Akademický článek
The Determinants of Implied Volatility: A Test Using LIFFE Option Prices.
Autor: Copeland, L., Poon, S.H.
Publikováno v: Journal of Business Finance & Accounting. Sep/Oct2000, Vol. 27 Issue 7/8, p859-885. 27p. 4 Charts.
Zobrazit plný text záznamu
3
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
4
Optimizing active ranges for consistent dynamic map labeling
Autor: Been, K., Nöllenburg, M., Poon, S.H., Wolff, A., Petitjean, S.
Publikováno v: Abstracts 24th European Workshop on Computational Geometry (EuroCG'08, Nancy, France, March 18-20, 2008), 55-58
STARTPAGE=55;ENDPAGE=58;TITLE=Abstracts 24th European Workshop on Computational Geometry (EuroCG'08, Nancy, France, March 18-20, 2008)
Map labeling encounters unique issues in the context of dynamic maps with continuous zooming and panning—an application with increasing practical importance. In consistent dynamic map labeling, distracting behavior such as popping and jumping is av
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::1d2a304d749250a8054e9fe7cfed120f
https://research.tue.nl/nl/publications/71b9add4-8529-4d97-887a-6b4db2e515e1
Zobrazit plný text záznamu
5
Fault-tolerant conflict-free coloring
Autor: Abam, M.A., Berg, de, M.T., Poon, S.H.
Publikováno v: Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008), 95-98
STARTPAGE=95;ENDPAGE=98;TITLE=Proceedings 20th Canadian Conference on Computational Geometry (CCCG'08, Montréal, Québec, Canada, August 13-15, 2008)
Background. Consider a cellular network consisting of a set of base stations, where the signal from a given base station can be received by clients within a certain distance from the base station. In general, these regions will overlap. For a client,
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::86690c85912a72d9a1d239696dd5efe0
https://research.tue.nl/nl/publications/4b71ff28-a21a-439e-b9f9-34c5dc8541e5
Zobrazit plný text záznamu
6
Unfolding lattice polygons on some lattice polyhedra
Autor: Poon, S.H., Aichholzer, O., Hackl, T.
Publikováno v: Collection of Abstracts of the 23rd European Workshop on Computational Geometry (EWCG 2007) 19-21 March 2007, Graz, Austria, 2-5
STARTPAGE=2;ENDPAGE=5;TITLE=Collection of Abstracts of the 23rd European Workshop on Computational Geometry (EWCG 2007) 19-21 March 2007, Graz, Austria
We consider the problem of unfolding lattice polygons embedded on the surface of some classes of lattice polyhedra. We show that an unknotted lattice polygon embedded on a lattice orthotube or orthotree can be convexified in O(n) moves and time, and
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::3429a257c22f58db1e8dc01e96329212
https://research.tue.nl/nl/publications/8f0a4a88-5ca0-49aa-8a87-81c10efd2123
Zobrazit plný text záznamu
7
On unfolding trees and polygons on various lattices
Autor: Poon, S.H., Bose, P.
Publikováno v: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007) 20-22 August 2007, Ottawa, Canada, 69-72
STARTPAGE=69;ENDPAGE=72;TITLE=Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG 2007) 20-22 August 2007, Ottawa, Canada
We consider the problem of unfolding lattice trees and polygons in hexagonal or triangular lattice in two dimensions. We show that a hexagonal/triangular lattice chain (resp. tree) can be straightened in O(n) (resp. O(n2)) moves and time, and a hexag
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::c4dca78e2c84c9531774d1853201ba1f
https://research.tue.nl/nl/publications/f79d11f9-5066-4d41-b7d3-45cc7e082a63
Zobrazit plný text záznamu
9
Few optimal foldings of HP protein chains on various letters
Autor: Poon, S.H., Thite, S., Emiris, I., Karavelas, M., Palios, L.
Publikováno v: Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006), 63-66
STARTPAGE=63;ENDPAGE=66;TITLE=Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006)
We consider whether or not protein chains in the HP model have unique or few optimal foldings. We solve the conjecture proposed by Aichholzer et al. that the open chain L2k-1 = (HP)k(PH)k-1 for k ?? 3 has exactly two optimal foldings on the square la
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::02c139022768304921b627418aff02da
https://research.tue.nl/nl/publications/dcc61f92-9bec-47b6-8cdb-c1bf6eb361c2
Zobrazit plný text záznamu
10
Kinetic collision detection for balls rolling on a plane
Autor: Abam, M.A., Berg, de, M., Poon, S.H., Speckmann, B.
Publikováno v: ISSUE=22;STARTPAGE=55;ENDPAGE=58;TITLE=22nd European Workshop on Computational Geometry (EuroCG 2006)
This abstract presents a first step towards kinetic col- lision detection in 3 dimensions. In particular, we design a compact and responsive kinetic data struc- ture (KDS) for detecting collisions between n balls of arbitrary sizes rolling on a plane
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::d9418bc108aef023cd24f28c8f854c4d
https://research.tue.nl/nl/publications/04b65467-a56d-46cf-8788-3f7023962ac1
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje