Sciweavers

799 search results - page 136 / 160
» Refinement and Separation Contexts
Sort
View
133
Voted
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 10 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
ICML
2008
IEEE
16 years 4 months ago
Topologically-constrained latent variable models
In dimensionality reduction approaches, the data are typically embedded in a Euclidean latent space. However for some data sets this is inappropriate. For example, in human motion...
Raquel Urtasun, David J. Fleet, Andreas Geiger, Jo...
205
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
143
Voted
ISSTA
2009
ACM
15 years 10 months ago
Exception analysis and points-to analysis: better together
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Martin Bravenboer, Yannis Smaragdakis
ADC
2007
Springer
145views Database» more  ADC 2007»
15 years 9 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro