Sciweavers

343 search results - page 58 / 69
» The scale of edges
Sort
View
PR
2008
188views more  PR 2008»
14 years 11 months ago
Detection and recognition of contour parts based on shape similarity
Due to distortion, noise, segmentation errors, overlap, and occlusion of objects in digital images, it is usually impossible to extract complete object contours or to segment the ...
Xiang Bai, Xingwei Yang, Longin Jan Latecki
CGF
2000
109views more  CGF 2000»
14 years 11 months ago
External Memory View-Dependent Simplification
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
Jihad El-Sana, Yi-Jen Chiang
IJIG
2002
117views more  IJIG 2002»
14 years 11 months ago
Eigenspaces for Graphs
In this paper, we investigate the feasibility of using graph-based descriptions to learn the view structure of 3D objects. The graphs used in our study are constructed from the De...
Bin Luo, Edwin R. Hancock, Richard C. Wilson
PVLDB
2010
129views more  PVLDB 2010»
14 years 10 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
IPPS
2010
IEEE
14 years 9 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha