16430 search results - page 345 / 3286 » On Computable Tree Functions |
172
click to vote
WEA
2010
Springer
15 years 12 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
138
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents an improved version of our specific methodology to detect the vessel tree in retinal angiographies. The automatic analysis of retinal vessel tree facilitates ...
140
Voted
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...
129
Voted
HPCC
2007
Springer
15 years 11 months ago
2007
Springer
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
165
Voted
SIGGRAPH
1995
ACM
15 years 8 months ago
1995
ACM
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...