3360 search results - page 356 / 672 » Opportunistic Data Structures with Applications |
172
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial sur...
193
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
ma's abstract data model consists of components, which are the structures that eventually define a schema as a whole. XML Schema's XML syntax, on the other hand, is not ...
187
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
177
click to vote
VL
2009
IEEE
16 years 1 months ago
2009
IEEE
Understanding and maintaining the structure of large ontologies is a cognitively demanding task. Visualizations are commonly used as a cognitive aid for presenting large ontologie...
184
click to vote
CAI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...