278 search results - page 34 / 56 » Algorithmic randomness and monotone complexity on product sp... |
NIPS
2004
13 years 9 months ago
2004
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...
IJAC
2006
13 years 8 months ago
2006
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
CEC
2010
IEEE
13 years 3 days ago
2010
IEEE
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...