1859 search results - page 258 / 372 » Using Problems to Learn Service-Oriented Computing |
143
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
204
click to vote
PAMI
2012
13 years 7 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
147
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
124
click to vote
ICTAI
2007
IEEE
15 years 11 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
142
click to vote
FC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersec...