Sciweavers

2516 search results - page 503 / 504
» When is there a representer theorem
Sort
View
CIKM
2011
Springer
12 years 5 months ago
Learning to aggregate vertical results into web search results
Aggregated search is the task of integrating results from potentially multiple specialized search services, or verticals, into the Web search results. The task requires predicting...
Jaime Arguello, Fernando Diaz, Jamie Callan
ASPLOS
2012
ACM
12 years 1 months ago
An update-aware storage system for low-locality update-intensive workloads
Traditional storage systems provide a simple read/write interface, which is inadequate for low-locality update-intensive workloads because it limits the disk scheduling flexibili...
Dilip Nijagal Simha, Maohua Lu, Tzi-cker Chiueh
TOG
2012
184views Communications» more  TOG 2012»
11 years 8 months ago
Image melding: combining inconsistent images using patch-based synthesis
Current methods for combining two different images produce visible artifacts when the sources have very different textures and structures. We present a new method for synthesizing...
Soheil Darabi, Eli Shechtman, Connelly Barnes, Dan...
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 8 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 8 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart