Sciweavers

CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 11 months ago
Learning Isometric Separation Maps
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 11 months ago
Logics for XML
Pierre Genevès
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 11 months ago
Efficient Algorithmic Techniques for Several Multidimensional Geometric Data Management and Analysis Problems
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
Mugurel Ionut Andreica
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 11 months ago
Graphical Presentations of Symmetric Monoidal Closed Theories
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...
Richard H. G. Garner, Tom Hirschowitz, Auré...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 11 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 11 months ago
Resource Allocation and Relay Selection for Collaborative Communications
Abstract--We investigate the relay selection problem in a network where users are able to collaborate with each other; decode and forward the messages of each other along with thei...
Saeed Akhavan-Astaneh, Saeed Gazor
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 11 months ago
Entropy of Hidden Markov Processes via Cycle Expansion
Armen E. Allahverdyan
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 11 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 11 months ago
A new distance for high level RNA secondary structure comparison
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
Julien Allali, Marie-France Sagot