3663 search results - page 351 / 733 » Problems in the ontology of computer programs |
159
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
223
click to vote
STACS
2005
Springer
16 years 8 days ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
165
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
Vectorless power grid verification makes it possible to evaluate worst-case voltage drops without enumerating possible current waveforms. Under linear current constraints, the vec...
177
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
178
click to vote
FOIKS
2004
Springer
16 years 5 days ago
2004
Springer
We introduce a simple and practically efficient method for repairing inconsistent databases. The idea is to properly represent the underlying problem, and then use off-the-shelf a...