3049 search results - page 572 / 610 » On the Convergence of Bound Optimization Algorithms |
VLDB
1998
ACM
14 years 28 days ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
PLDI
1995
ACM
14 years 7 days ago
1995
ACM
Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing othe...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...