Sciweavers

3640 search results - page 414 / 728
» The Geometry of Web Search
Sort
View
WAIM
2010
Springer
15 years 4 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
COMPGEOM
2009
ACM
16 years 1 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
ICCSA
2007
Springer
16 years 28 days ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
IMR
2004
Springer
16 years 4 days ago
Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
Yasushi Ito, Alan M. Shih, Bharat K. Soni
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
15 years 11 months ago
Examples of 3D Grasp Quality Computations
Previous grasp quality research is mainly theoretical, and has assumed that contact types and positions are given, in order to preserve the generality of the proposed quality meas...
Andrew T. Miller, Peter K. Allen