Sciweavers

994 search results - page 53 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
PAMI
2010
122views more  PAMI 2010»
14 years 11 months ago
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
—This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available o...
Lorenzo Bruzzone, Mattia Marconcini
PET
2004
Springer
15 years 6 months ago
Secure Outsourcing of Sequence Comparisons
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
Mikhail J. Atallah, Jiangtao Li
120
Voted
FOCS
2008
IEEE
15 years 7 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
LCTRTS
2007
Springer
15 years 7 months ago
Integrated CPU and l2 cache voltage scaling using machine learning
Embedded systems serve an emerging and diverse set of applications. As a result, more computational and storage capabilities are added to accommodate ever more demanding applicati...
Nevine AbouGhazaleh, Alexandre Ferreira, Cosmin Ru...
COR
2007
108views more  COR 2007»
15 years 22 days ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian