Sciweavers

17 search results - page 3 / 4
» Polygon Properties Calculated from the Vertex Neighborhoods
Sort
View
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 3 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
GI
2007
Springer
13 years 11 months ago
Texture-based Surface Segmentation Using Second-order Statistics of Illumination Series
: Many automated visual inspection applications rely on a segmentation of surfaces into meaningful regions, for instance into defective and non-defective areas. This paper presents...
Christoph Lindner, Fabian Schäffler, Fernando...
CVPR
2007
IEEE
14 years 7 months ago
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
Brian Amberg, Sami Romdhani, Thomas Vetter
ICCS
2009
Springer
14 years 2 days ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
TPDS
2002
155views more  TPDS 2002»
13 years 5 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu