Sciweavers

727 search results - page 47 / 146
» One line and n points
Sort
View
CCCG
2010
14 years 11 months ago
k-star-shaped polygons
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
Jeff Sember, William Evans
TVCG
1998
143views more  TVCG 1998»
14 years 9 months ago
Calibration-Free Augmented Reality
We describe the design and implementation of a videobasedaugmentedreality system capableof overlayingthreedimensional graphical objects on live video of dynamic environments. The ...
Kiriakos N. Kutulakos, James R. Vallino
INFOCOM
2007
IEEE
15 years 4 months ago
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N Ã...
Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-S...
COCOA
2009
Springer
15 years 2 months ago
Variable-Size Rectangle Covering
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang
ICALP
2007
Springer
15 years 1 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...