Sciweavers

2638 search results - page 24 / 528
» Random Geometric Complexes
Sort
View
ILP
2004
Springer
15 years 7 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
APAL
2008
92views more  APAL 2008»
15 years 2 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
MICCAI
2009
Springer
16 years 3 months ago
Probabilistic Region Matching in Narrow-Band Endoscopy for Targeted Optical Biopsy
Recent advances in biophotonics have enabled in-vivo, in-situ histopathology for routine clinical applications. The non-invasive nature of these optical `biopsy' techniques, h...
Selen Atasoy, Ben Glocker, Stamatia Giannarou, ...
FSS
2010
111views more  FSS 2010»
15 years 14 days ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
IJCV
2000
74views more  IJCV 2000»
15 years 1 months ago
Meaningful Alignments
We propose a method for detecting geometric structures in an image, without any a priori information. Roughly speaking, we say that an observed geometric event is "meaningful&...
Agnès Desolneux, Lionel Moisan, Jean-Michel...