Wyniki wyszukiwania:

This problem was presented by Barany and Onn in 1997 and it is still not known if a polynomial-time algorithm for the problem exists. The monochrome version of this problem, expressing p as a convex combination of points in a set S, is a traditional linear programming feasibility problem. The colourful Caratheodory Theorem, due to Barany in 1982, provides a sufficient condition for the existence of a colourful set of points containing p in its convex hull. Barany's result was generalized by Holmsen et al. in 2008 and by Arocha et al. in 2009 before being recently further generalized by...

This book provides a practical guide in neuro-ophthalmology. It contains more than 80 carefully selected neuro-ophthalmic cases. It covers visual afferent (Part 1) and efferent disorders (Part 2): the various optic neuropathies, diplopia from ocular and neurologic pathogen, pupil and lid abnormality. Each case presents with neuro-ophthalmology examination format, followed by ancillary test, finial diagnose, treatment and prognosis. A short review or comment highlights the important points of these disorders, up to date progress and literature are addressed in part of them. The novel optical...

This brief surveys existing techniques to address the problem of long delays and high power consumption for web browsing on smartphones, which can be due to the local computational limitation at the smartphone (e.g., running java scripts or flash objects) level. To address this issue, an architecture called Virtual-Machine based Proxy (VMP) is introduced, shifting the computing from smartphones to the VMP which may reside in the cloud. Mobile Web Browsing Using the Cloud illustrates the feasibility of deploying the proposed VMP system in 3G networks through a prototype using Xen virtual...