Sciweavers

870 search results - page 49 / 174
» Graph Comparison Using Fine Structure Analysis
Sort
View
DAGM
2008
Springer
14 years 11 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
DDEP
2000
Springer
15 years 2 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
LREC
2010
146views Education» more  LREC 2010»
14 years 11 months ago
The Semantic Atlas: an Interactive Model of Lexical Representation
In this paper we describe two geometrical models of meaning representation, the Semantic Atlas (SA) and the Automatic Contexonym Organizing Model (ACOM). The SA provides maps of m...
Sabine Ploux, Armelle Boussidan, Hyungsuk Ji
TIP
2010
155views more  TIP 2010»
14 years 8 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
CVPR
2012
IEEE
13 years 5 days ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee