Sciweavers

89 search results - page 15 / 18
» Sparse Recovery by Non-convex Optimization -- Instance Optim...
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 11 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
NIPS
2007
13 years 9 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
CHES
2010
Springer
166views Cryptology» more  CHES 2010»
13 years 8 months ago
Algebraic Side-Channel Analysis in the Presence of Errors
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
Yossef Oren, Mario Kirschbaum, Thomas Popp, Avisha...
ICPR
2006
IEEE
14 years 8 months ago
Using Specularities to Recover Multiple Light Sources in the Presence of Texture
Recovering multiple point light sources from a sparse set of photographs in which objects of unknown texture can move is challenging. This is because both diffuse and specular ref...
Pascal Lagger, Pascal Fua