1387 search results - page 239 / 278 » Convexity in Discrete Space |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
2010
Eurographics
We present an automatic method to recover high-resolution texture over an object by mapping detailed photographs onto its surface. Such high-resolution detail often reveals inaccu...
ICPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
PERCOM
2009
ACM
14 years 3 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...