Sciweavers

62 search results - page 11 / 13
» A Probabilistic Clustering-Projection Model for Discrete Dat...
Sort
View
PAMI
2007
101views more  PAMI 2007»
13 years 7 months ago
A Thousand Words in a Scene
— This paper presents a novel approach for visual scene modeling and classification, investigating the combined use of text modeling methods and local invariant features. Our wo...
Pedro Quelhas, Florent Monay, Jean-Marc Odobez, Da...
MICCAI
2009
Springer
14 years 12 days ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an e...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
14 years 2 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ICML
2000
IEEE
14 years 8 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...