Sciweavers

1995 search results - page 202 / 399
» What's the Problem
Sort
View
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 11 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
FOGA
1998
15 years 6 months ago
Understanding Interactions among Genetic Algorithm Parameters
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
Kalyanmoy Deb, Samir Agrawal
CVPR
2006
IEEE
16 years 6 months ago
The Panum Proxy Algorithm for Dense Stereo Matching over a Volume of Interest
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
Ankur Agarwal, Andrew Blake
149
Voted
ICPR
2006
IEEE
16 years 5 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