Sciweavers

2295 search results - page 345 / 459
» Learning Overcomplete Representations
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 10 months ago
Boosting for Text Classification with Semantic Features
Abstract. Current text classification systems typically use term stems for representing document content. Semantic Web technologies allow the usage of features on a higher semantic...
Stephan Bloehdorn, Andreas Hotho
CVPR
2010
IEEE
14 years 6 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
ISBI
2009
IEEE
14 years 5 months ago
Probabilistic Branching Node Detection Using Hybrid Local Features
Probabilistic branching node inference is an important step for analyzing branching patterns involved in many anatomic structures. We propose combining machine learning techniques...
Haibin Ling, Michael Barnathan, Vasileios Megalooi...
ICDAR
2009
IEEE
14 years 4 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
ACCV
2009
Springer
14 years 4 months ago
Levels of Details for Gaussian Mixture Models
Mixtures of Gaussians are a crucial statistical modeling tool at the heart of many challenging applications in computer vision and machine learning. In this paper, we first descri...
Vincent Garcia, Frank Nielsen, Richard Nock