Sciweavers

3208 search results - page 163 / 642
» A Lower Bound for Primality
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
GRAPHITE
2006
ACM
16 years 1 months ago
Camera textures
In this paper we introduce a novel real-time rendering technique for camera deformations that can be applied to lens distortions and non-realistic projections. Our technique is ba...
Martin Spindler, Marco Bubke, Tobias Germer, Thoma...
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
ICIP
2009
IEEE
15 years 4 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger