Sciweavers

CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 6 months ago
Universal Metadata Standard
The basis of consciousness is an association of notions, the neuronal network. Similarly, the creation of a next generation internet (semantic web) is impossible without attributes...
Andrej Poleev
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 6 months ago
Image Encryption Based on Diffusion and Multiple Chaotic Maps
G. A. Sathishkumar, K. Bhoopathy bagan, N. Sriraam
CORR
2011
Springer
200views Education» more  CORR 2011»
13 years 6 months ago
Validation Measures in CMMI
—Validation is one of the software engineering disciplines that help build quality into software. The major objective of software validation process is to determine that the soft...
Mahmoud Khraiwesh
CORR
2011
Springer
207views Education» more  CORR 2011»
13 years 6 months ago
The AllDifferent Constraint with Precedences
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
CORR
2011
Springer
212views Education» more  CORR 2011»
13 years 6 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 6 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 6 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 6 months ago
Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
Zhilin Zhang, Bhaskar D. Rao
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 6 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 6 months ago
Physical expander in Virtual Tree Overlay
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valer...