Sciweavers

159 search results - page 28 / 32
» Geometric Bounds for Generalization in Boosting
Sort
View
SECON
2008
IEEE
14 years 2 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
VRST
2004
ACM
14 years 1 months ago
Interactive collision detection for complex and deformable models using programmable graphics hardware
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
Wei Chen, Huagen Wan, Hongxin Zhang, Hujun Bao, Qu...
COMPGEOM
2009
ACM
14 years 1 months ago
The scale axis picture show
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
Joachim Giesen, Balint Miklos, Mark Pauly, Camille...
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 3 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 3 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan