Sciweavers

1647 search results - page 279 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
MLG
2007
Springer
14 years 3 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
PADS
1999
ACM
14 years 1 months ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto
TIFS
2010
173views more  TIFS 2010»
13 years 7 months ago
A hybrid approach for generating secure and discriminating face template
Abstract—Biometric template protection is one of the most important issues in deploying a practical biometric system. To tackle this problem, many algorithms, that do not store t...
Yi C. Feng, Pong C. Yuen, Anil K. Jain
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder