Sciweavers

1494 search results - page 91 / 299
» Kernels for Global Constraints
Sort
View
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 7 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICIP
2010
IEEE
13 years 7 months ago
Single image deblurring with adaptive dictionary learning
We propose a motion deblurring algorithm that exploits sparsity constraints of image patches using one single frame. In our formulation, each image patch is encoded with sparse co...
Zhe Hu, Jia-Bin Huang, Ming-Hsuan Yang
ICML
2009
IEEE
14 years 10 months ago
Geometry-aware metric learning
In this paper, we introduce a generic framework for semi-supervised kernel learning. Given pairwise (dis-)similarity constraints, we learn a kernel matrix over the data that respe...
Zhengdong Lu, Prateek Jain, Inderjit S. Dhillon
IBPRIA
2007
Springer
14 years 3 months ago
Spectral Modes of Facial Needle-Maps
Abstract. This paper presents a method to decompose a field of surface normals (needle-map). A diffusion process is used to model the flow of height information induced by a fi...
Roberto Fraile, Edwin R. Hancock
COMPULOG
1999
Springer
14 years 1 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh