Sciweavers

2031 search results - page 207 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
149
Voted
MFCS
2010
Springer
14 years 9 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
OOPSLA
2010
Springer
14 years 9 months ago
Specifying and implementing refactorings
Modern IDEs for object-oriented languages like Java provide support for a basic set of simple automated refactorings whose behaviour is easy to describe intuitively. It is, howeve...
Max Schäfer, Oege de Moor
PAMI
2010
225views more  PAMI 2010»
14 years 9 months ago
The Biometric Menagerie
The problem of biometric menagerie, first pointed out by Doddington et al. (1998), is one that plagues all biometric systems. They observe that only a handful of clients (enrolle...
Neil Yager, Ted Dunstone
97
Voted
PAMI
2010
337views more  PAMI 2010»
14 years 9 months ago
Single-Image Super-Resolution Using Sparse Regression and Natural Image Prior
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...
Kwang In Kim, Younghee Kwon
SDMW
2010
Springer
14 years 9 months ago
Joining Privately on Outsourced Data
In an outsourced database framework, clients place data management with specialized service providers. Of essential concern in such frameworks is data privacy. Potential clients ar...
Bogdan Carbunar, Radu Sion