Sciweavers

528 search results - page 36 / 106
» Degrees of categoricity of computable structures
Sort
View
ICCS
2005
Springer
14 years 2 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...
AI
2007
Springer
13 years 8 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
CLOR
2006
14 years 11 days ago
Object Recognition by Combining Appearance and Geometry
We present a new class of statistical models for part-based object recognition. These models are explicitly parametrized according to the degree of spatial structure that they can ...
David J. Crandall, Pedro F. Felzenszwalb, Daniel P...
ECML
2001
Springer
14 years 1 months ago
Iterative Double Clustering for Unsupervised and Semi-supervised Learning
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...
Ran El-Yaniv, Oren Souroujon
NIPS
2004
13 years 10 months ago
Parametric Embedding for Class Visualization
In this paper, we propose a new method, Parametric Embedding (PE), for visualizing the posteriors estimated over a mixture model. PE simultaneously embeds both objects and their c...
Tomoharu Iwata, Kazumi Saito, Naonori Ueda, Sean S...