Sciweavers

246 search results - page 10 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
EMMCVPR
2005
Springer
15 years 3 months ago
Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...
ICCV
1998
IEEE
15 years 11 months ago
View-Based Object Matching
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson
KIVS
2005
Springer
15 years 3 months ago
A Case for Lightweight SuperPeer Topologies
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
15 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
73
Voted
SMA
2005
ACM
109views Solid Modeling» more  SMA 2005»
15 years 3 months ago
Numerical decomposition of geometric constraints
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
Sebti Foufou, Dominique Michelucci, Jean-Paul Jurz...