635 search results - page 123 / 127 » Some Computational Problems Related to Pseudo-intents |
132
click to vote
ECCV
2008
Springer
15 years 3 months ago
2008
Springer
We present a novel method for unsupervised classification, including the discovery of a new category and precise object and part localization. Given a set of unlabelled images, som...
121
click to vote
AAAI
2010
15 years 3 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
106
click to vote
CC
2007
Springer
15 years 1 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
148
click to vote
ALIFE
2005
15 years 1 months ago
2005
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
112
click to vote
CPHYSICS
2004
15 years 1 months ago
2004
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...