Sciweavers

591 search results - page 81 / 119
» Computing fundamental groups from point clouds
Sort
View
INFOCOM
2006
IEEE
15 years 5 months ago
Predictability of WLAN Mobility and Its Effects on Bandwidth Provisioning
— Wireless local area networks (WLANs) are emerging as a popular technology for access to the Internet and enterprise networks. In the long term, the success of WLANs depends on ...
Libo Song, Udayan Deshpande, Ulas C. Kozat, David ...
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
15 years 11 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
PRL
2010
158views more  PRL 2010»
14 years 9 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
ICDCS
2010
IEEE
15 years 2 months ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
15 years 29 days ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof