Sciweavers

2498 search results - page 349 / 500
» Algorithms for the Topological Watershed
Sort
View
CGF
2005
69views more  CGF 2005»
13 years 8 months ago
Structure Preserving CAD Model Repair
There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface ...
Stephan Bischoff, Leif Kobbelt
TWC
2008
155views more  TWC 2008»
13 years 8 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...
CN
2004
101views more  CN 2004»
13 years 8 months ago
Adaptive scheduling for integrated traffic on WDM optical networks
One of the important issues in the design of future generation of high-speed networks is to provide differentiated service to different types of traffic with various time constrai...
Maode Ma, Xiaohong Huang
PAMI
2007
197views more  PAMI 2007»
13 years 7 months ago
A Lattice-Based MRF Model for Dynamic Near-Regular Texture Tracking
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
Wen-Chieh Lin, Yanxi Liu
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...