1539 search results - page 168 / 308 » Fast and Simple Methods For Computing Control Points |
84
Voted
MOBISYS
2003
ACM
16 years 1 months ago
2003
ACM
We propose the Robust Overlay Architecture for Mobility (ROAM) to provide seamless mobility for Internet hosts. ROAM is built on top of the Internet Indirection Infrastructure (i3...
139
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
We present a real-time approach for image-based localization within large scenes that have been reconstructed offline using structure from motion (Sfm). From monocular video, our...
122
click to vote
SIBGRAPI
2003
IEEE
15 years 7 months ago
2003
IEEE
A picking mechanism (pointing and indicating) with the cursor is essential for any direct-manipulation application. The windowing systems, under which control a direct-manipulation...
144
Voted
TVCG
2012
13 years 4 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
139
click to vote
EC
1998
15 years 1 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...