Sciweavers

667 search results - page 21 / 134
» Computably Based Locally Compact Spaces
Sort
View
SMA
2006
ACM
132views Solid Modeling» more  SMA 2006»
14 years 1 months ago
Generalized penetration depth computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
RSS
2007
134views Robotics» more  RSS 2007»
13 years 9 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
ICPR
2010
IEEE
13 years 5 months ago
Local Binary Pattern-Based Features for Text Identification of Web Images
We present a method of robustly identifying a text block in complex web images. The method is a MLP (Multilayer perceptron) classifier trained on LBP (Local binary patterns), wavel...
Insook Jung, Il-Seok Oh
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
14 years 9 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen
TKDE
2008
141views more  TKDE 2008»
13 years 7 months ago
Location Fingerprinting In A Decorrelated Space
We present a novel approach to the problem of the indoor localization in wireless environments. The main contribution of this paper is four folds: (a) We show that, by projecting t...
Shih-Hau Fang, Tsung-Nan Lin, Po-Chiang Lin