The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
With the emergence of new applications centered around the sharing of image data, questions concerning the protection of the privacy of people visible in the scene arise. Recently...
Ralph Gross, Latanya Sweeney, Fernando De la Torre...
A problem of using mixture-of-Gaussian models for unsupervised texturesegmentationisthat "multimodal"textures(such ascan often be encountered in natural images) cannot b...