3116 search results - page 569 / 624 » Recovering |
133
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
155
click to vote
SIGGRAPH
1999
ACM
15 years 9 months ago
1999
ACM
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
144
Voted
ICCV
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
122
click to vote
VISUALIZATION
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
131
click to vote
INFOCOM
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...